Scribd
Upload
17 views13 pages

Understanding Linear Bounded Automata

Linear Bounded Automata (LBAs) are similar to Turing Machines but operate within the constraints of their input tape space. They are defined as NonDeterministic and can accept languages that are more powerful than Non-deterministic Pushdown Automata (NPDA) but less powerful than Turing Machines. The document also discusses the Chomsky Hierarchy, highlighting the relationship between unrestricted grammars, context-sensitive grammars, and the languages they generate.

Uploaded by

Surya Forever
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd
17 views13 pages

Understanding Linear Bounded Automata

Linear Bounded Automata (LBAs) are similar to Turing Machines but operate within the constraints of their input tape space. They are defined as NonDeterministic and can accept languages that are more powerful than Non-deterministic Pushdown Automata (NPDA) but less powerful than Turing Machines. The document also discusses the Chomsky Hierarchy, highlighting the relationship between unrestricted grammars, context-sensitive grammars, and the languages they generate.

Uploaded by

Surya Forever
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as PDF, TXT or read online on Scribd

Linear Bounded Automata

LBAs
Linear Bounded Automata (LBAs)
are the same as Turing Machines
with one difference:

The input string tape space


is the only tape space allowed to use
Linear Bounded Automaton (LBA)

Input string
[ a b c d e ]

Working space
Left-end in tape Right-end
marker marker

All computation is done between


end markers
We define LBA’s as NonDeterministic

Open Problem:
NonDeterministic LBA’s
have same power with
Deterministic LBA’s ?
Example languages accepted by LBAs:

L = {a b c }
n n n

L = {a }
n!

LBA’s have more power than NPDA’s

LBA’s have also less power


than Turing Machines
The Chomsky Hierarchy
Unrestricted Grammars:

Productions u must have at least one non-terminal &


v can be a combination of (T X non-T)*

u→v

String of variables String of variables


and terminals and terminals
Example unrestricted grammar:

S → aBc
aB → cA
Ac → d
Theorem:

A language L is recursively enumerable


if and only if L is generated by an
unrestricted grammar
Context-Sensitive Grammars:

Productions
u→v v can be a combination of (T X non-T)+
epsilon is not allowed here

String of variables String of variables


and terminals and terminals

and: |u|  |v|


The language n n n
{a b c }
is context-sensitive:

S → abc | aAbc
Ab → bA
Ac → Bbcc
bB → Bb
aB → aa | aaA
Theorem:
A language L is context sensistive
if and only if
L is accepted by a Linear-Bounded
automaton

Observation:
There is a language which is
context-sensitive
but not recursive
The Chomsky Hierarchy

Non-recursively enumerable

Recursively-enumerable
Recursive

Context-sensitive

Context-free

Regular

You might also like