Scribd
Upload
66 views

Chomsky Hierarchy

The document discusses the Chomsky hierarchy and applications of different types of automata. It covers: 1) Applications of Turing machines, linear bounded automata, pushdown automata, and finite automata. 2) Linear bounded automata have more power than pushdown automata but less power than Turing machines. 3) A language is Turing-acceptable if and only if it is generated by an unrestricted grammar. A language is context-sensitive if and only if it is accepted by a linear bounded automaton. 4) The Chomsky hierarchy orders languages from most restrictive (regular) to least restrictive (Turing-acceptable).

Uploaded by

InshadRT Noman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
66 views

Chomsky Hierarchy

The document discusses the Chomsky hierarchy and applications of different types of automata. It covers: 1) Applications of Turing machines, linear bounded automata, pushdown automata, and finite automata. 2) Linear bounded automata have more power than pushdown automata but less power than Turing machines. 3) A language is Turing-acceptable if and only if it is generated by an unrestricted grammar. A language is context-sensitive if and only if it is accepted by a linear bounded automaton. 4) The Chomsky hierarchy orders languages from most restrictive (regular) to least restrictive (Turing-acceptable).

Uploaded by

InshadRT Noman
Copyright
© © All Rights Reserved
Available Formats
Download as PPT, PDF, TXT or read online on Scribd
You are on page 1/ 28

CSE322

The Chomsky Hierarchy

Lecture #16
Applications of Automata
• TM- Real Life Implementation ,Software
Implementation
• LBA- Generic Programming, Parse Trees
• PDA-Online Tracking processing
system,Top Down Parsing in LL Grammer
• FA-Finite State Programming,UML State
Diagrams, Acceptors and Recoganizers,
Lexical Analyzer
Recursive and Enumerable Sets
Linear-Bounded Automata:

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 Right-end
in tape
marker marker

All computation is done between end markers


We define LBA’s as NonDeterministic

Open Problem:

NonDeterministic LBA’s
have same power as
Deterministic LBA’s ?
Example languages accepted by LBAs:

n n n n!
L  {a b c } L  {a }

LBA’s have more power than PDA’s


(pushdown automata)

LBA’s have less power than Turing Machines


Unrestricted Grammars:

Productions
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 Turing-Acceptable
if and only if L is generated by an
unrestricted grammar
Context-Sensitive Grammars:

Productions
uv

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
it is accepted by a Linear-Bounded automaton

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

Non Turing-Acceptable

Turing-Acceptable
decidable

Context-sensitive

Context-free

Regular
LANGUAGES AND AUTOMATON
Questions
Prove it as
Left Linear Grammer vs Right Linear
Grammer
Left Linear Grammer vs Right Linear
Grammer
• Regular language works on right linear
• Whereas CFG and CSG can work on left
linear

You might also like