Undecidability of emptiness of LBA

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

Question

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

No correct solution

Licensed under: CC-BY-SA with attribution
Not affiliated with cs.stackexchange
scroll top