Professional Documents
Culture Documents
LBAs
Input string
[ a b c d e ]
Working space
Left-end Right-end
in tape
marker marker
Open Problem:
NonDeterministic LBA’s
have same power with
Deterministic LBA’s ?
n n n
L {a b c }
n!
L {a }
Productions
uv
S aBc
aB cA
Ac d
Productions
uv
S abc | aAbc
Ab bA
Ac Bbcc
bB Bb
aB aa | aaA
Fall 2003 Costas Busch - RPI 11
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
Fall 2003 Costas Busch - RPI 12
The Chomsky Hierarchy
Non-recursively enumerable
Recursively-enumerable
Recursive
Context-sensitive
Context-free
Regular
Fall 2003 Costas Busch - RPI 13