- Related Questions & Answers
- Prove that Linear bounded automata LBA ⊂ PSPACE in TOC?
- What is Linear bounded automata in TOC?
- Compare Push down automata and Linear bounded automata
- Prove that the Hamiltonian Path is NP-Complete in TOC
- Prove that the vertex cover is NP complete in TOC
- Explain Deterministic Finite Automata in TOC.
- Explain Non-Deterministic Finite Automata in TOC.
- What is Push down automata in TOC?
- Explain the various applications of automata in TOC
- Explain non-deterministic push down automata in TOC?
- Explain about left linear regular grammar in TOC
- Explain about right linear regular grammars in TOC
- How to convert FA to Left Linear Grammar in TOC?
- Can you show some pictures that prove you a skilled photographer?
- Robot Bounded In Circle C++

- Selected Reading
- UPSC IAS Exams Notes
- Developer's Best Practices
- Questions and Answers
- Effective Resume Writing
- HR Interview Questions
- Computer Glossary
- Who is Who

Linear Bounded Automaton (LBA) is a restricted form of Turing Machine in which input tape is finite.

**Example**

Prove that LBA ⊂ PSPACE

PSPACE is a superset of the set of context-sensitive languages.

Now to prove LBA=PSPACE,

We use theorem of Space compression with tape reduction which states that,

For every k-tape S(n) space-bounded off-line Turing Machine M and constant c>0,there exists a one-tape cS(n) space-bounded off-line turing machine N such that L(M)=L(N).

**Following identity holds for −**

DSPACE(S(n))=DSPACE(O(S(n)))

and NSPACE(S(n))=NSPACE(O(S(n)))

Since LBA is one-tape n space-bounded Turing Machine it follows −

LBA=NSPACE(n)---------------------(1)

Now by Savitch theorem, if S is fully space constructible and S(n)>log(n) then

NSPACE(S(n)) ⊆DSPACE(S^{2}(n)) -------------(2)

**Final proof**

LBA=NSPACE(n)............by(1)

⊆DSPACE(n^{2})............by(2)

⊂DSPACE(n^{3})............by Space Hierarchy Theorem

⊆PSPACE

Space Hierarchy then requires S(n) which is fully space-constructible.

Advertisements