Undecidability of emptiness of LBA
-
05-11-2019 - |
質問
How is the emptiness of Linear Bound Automata (LBA) i.e $L = \{B \mid L(B) = \emptyset \}$ is undecidable?
正しい解決策はありません
所属していません cs.stackexchange
質問
How is the emptiness of Linear Bound Automata (LBA) i.e $L = \{B \mid L(B) = \emptyset \}$ is undecidable?
正しい解決策はありません