the chomsky hierarchy
Download
Skip this Video
Download Presentation
The Chomsky Hierarchy

Loading in 2 Seconds...

play fullscreen
1 / 12

The Chomsky Hierarchy - PowerPoint PPT Presentation


  • 105 Views
  • Uploaded on

The Chomsky Hierarchy. 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. Working space in tape. Left-end marker. Right-end marker.

loader
I am the owner, or an agent authorized to act on behalf of the owner, of the copyrighted work described.
capcha
Download Presentation

PowerPoint Slideshow about 'The Chomsky Hierarchy' - albert


An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -
Presentation Transcript
the chomsky hierarchy

The Chomsky Hierarchy

Prof. Busch - LSU

slide2

Linear-Bounded Automata:

Same as Turing Machines with one difference:

the input string tape space

is the only tape space allowed to use

Prof. Busch - LSU

slide3

Linear Bounded Automaton (LBA)

Input string

Working space

in tape

Left-end

marker

Right-end

marker

All computation is done between end markers

Prof. Busch - LSU

slide4

We define LBA’s as NonDeterministic

Open Problem:

NonDeterministic LBA’s

have same power as

Deterministic LBA’s ?

Prof. Busch - LSU

slide5

Example languages accepted by LBAs:

LBA’s have more power than PDA’s

(pushdown automata)

LBA’s have less power than Turing Machines

Prof. Busch - LSU

slide6

Unrestricted Grammars:

Productions

String of variables

and terminals

String of variables

and terminals

Prof. Busch - LSU

slide8

Theorem:

A language is Turing-Acceptable

if and only if is generated by an

unrestricted grammar

Prof. Busch - LSU

slide9

Context-Sensitive Grammars:

Productions

String of variables

and terminals

String of variables

and terminals

and:

Prof. Busch - LSU

slide10

The language

is context-sensitive:

Prof. Busch - LSU

slide11

Theorem:

A language 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

slide12

The Chomsky Hierarchy

Non Turing-Acceptable

Turing-Acceptable

decidable

Context-sensitive

Context-free

Regular

Prof. Busch - LSU

ad