Linear Bounded Automata

LBAs

Fall 2003 Costas Busch - RPI 1

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

Fall 2003 Costas Busch - RPI 2

 Linear Bounded Automaton (LBA)

Input string
[ a b c d e ]

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

All computation is done between end markers

Fall 2003 Costas Busch - RPI 3

 We define LBA’s as NonDeterministic

Open Problem:
NonDeterministic LBA’s
have same power with
Deterministic LBA’s ?

Fall 2003 Costas Busch - RPI 4

 Example languages accepted by LBAs:

n n n
L  {a b c }

n!
L  {a }

LBA’s have more power than NPDA’s

LBA’s have also less power

than Turing Machines
Fall 2003 Costas Busch - RPI 5
 The Chomsky Hierarchy

Fall 2003 Costas Busch - RPI 6

 Unrestricted Grammars:

Productions
uv

String of variables String of variables

and terminals and terminals

Fall 2003 Costas Busch - RPI 7

 Example unrestricted grammar:

S  aBc
aB  cA
Ac  d

Fall 2003 Costas Busch - RPI 8

Theorem:

A language L is recursively enumerable

if and only if L is generated by an
unrestricted grammar

Fall 2003 Costas Busch - RPI 9

 Context-Sensitive Grammars:

Productions
uv

String of variables String of variables

and terminals and terminals

and: |u|  |v|

Fall 2003 Costas Busch - RPI 10
 The language n n n
{a b c }
is context-sensitive:

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