Undecidability of emptiness of LBA

cs.stackexchange https://cs.stackexchange.com/questions/107247

题

How is the emptiness of Linear Bound Automata (LBA) i.e $L = \{B \mid L(B) = \emptyset \}$ is undecidable?

没有正确的解决方案

许可以下： CC-BY-SA 和 归因
不隶属于 cs.stackexchange
scroll top