Chomsky_Hierarchy

Chomsky_Hierarchy - A language is Turing-Acceptable if and...

Info iconThis preview shows pages 1–12. Sign up to view the full content.

View Full Document Right Arrow Icon
The Chomsky Hierarchy  
Background image of page 1

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Same as Turing Machines with one difference: the input string tape space is the only tape space allowed to use Linear-Bounded Automata:
Background image of page 2
[ ] a b c d e Left-end marker Input string Right-end marker Working space  in tape All computation is done between end markers Linear Bounded Automaton (LBA)
Background image of page 3

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
We define LBA’s as NonDeterministic Open Problem: NonDeterministic LBA’s have same power as Deterministic LBA’s ?
Background image of page 4
Example languages accepted by LBAs: } { n n n c b a L = } { ! n a L = LBA’s have more power than PDA’s                                       (pushdown automata) LBA’s have less power than Turing Machines 
Background image of page 5

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Unrestricted Grammars: Productions v u String of variables and terminals String of variables and terminals
Background image of page 6
Example unrestricted grammar: d Ac cA aB aBc S
Background image of page 7

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 8
Background image of page 9

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 10
Background image of page 11

Info iconThis preview has intentionally blurred sections. Sign up to view the full version.

View Full DocumentRight Arrow Icon
Background image of page 12
This is the end of the preview. Sign up to access the rest of the document.

Unformatted text preview: A language is Turing-Acceptable if and only if is generated by an unrestricted grammar L L Theorem: Context-Sensitive Grammars: and: | | | | v u Productions v u String of variables and terminals String of variables and terminals The language } { n n n c b a is context-sensitive: aaA aa aB Bb bB Bbcc Ac bA Ab aAbc abc S | | A language is context sensistive if and only if it is accepted by a Linear-Bounded automaton L Theorem: There is a language which is context-sensitive but not decidable Observation: Non Turing-Acceptable Turing-Acceptable decidable Context-sensitive Context-free Regular The Chomsky Hierarchy...
View Full Document

This note was uploaded on 12/02/2011 for the course AR 107 taught by Professor Gracegraham during the Fall '11 term at Montgomery College.

Page1 / 12

Chomsky_Hierarchy - A language is Turing-Acceptable if and...

This preview shows document pages 1 - 12. Sign up to view the full document.

View Full Document Right Arrow Icon
Ask a homework question - tutors are online