Professional Documents
Culture Documents
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 as
Deterministic LBA’s ?
n n n n!
L = {a b c } L = {a }
Productions
u→v
S → aBc
aB → cA
Ac → d
Productions
u→v
S → abc | aAbc
Ab → bA
Ac → Bbcc
bB → Bb
aB → aa | aaA
Prof. Busch - LSU 10
Theorem:
A language L is context sensistive
if and only if
it is accepted by a Linear-Bounded automaton
Observation:
There is a language which is context-sensitive
but not decidable
Prof. Busch - LSU 11
The Chomsky Hierarchy
Non Turing-Acceptable
Turing-Acceptable
decidable
Context-sensitive
Context-free
Regular
Prof. Busch - LSU 12