Skip to main content
Computer Science

Return to Question

added 77 characters in body
Source Link
xskxzr
xskxzr
  • 7.6k
  • 5
  • 23
  • 47

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

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

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

added 77 characters in body
Source Link
edit approved Apr 20, 2019 at 10:06
Mr. Sigma.
edit approved Apr 20, 2019 at 10:06
Mr. Sigma.
  • 1.3k
  • 1
  • 15
  • 38

How is the emptiness of Linear Bound Automata (LBA) i.e L = {B | L(B) = phi }$L = \{B | L(B) = \phi \}$ is undeciadableundecidable?

How is the emptiness of Linear Bound Automata (LBA) i.e L = {B | L(B) = phi } is undeciadable?

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

Source Link
SiluPanda
SiluPanda
  • 549
  • 1
  • 3
  • 12

Undecidability of emptiness of LBA

How is the emptiness of Linear Bound Automata (LBA) i.e L = {B | L(B) = phi } is undeciadable?