Undecidability of emptiness of LBA

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

Pergunta

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

Nenhuma solução correta

Licenciado em: CC-BY-SA com atribuição
Não afiliado a cs.stackexchange
scroll top