P. 1
Automata

Automata

5.0

|Views: 2,434|Likes:
Published by kirivarnan

More info:

Published by: kirivarnan on May 31, 2009
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

05/13/2013

pdf

text

original

Regular language

A language is called a regular language if some finite automaton recognizes it. For
example to recognize string that is a multiple of 4

But can regular language recognize strings of the form 0n1n ? No

Context Free Language

A language is called Context free language if and only if some pushdown
automaton recognizes it.

Turing
machines

PDA

DFA

r.e. language

Context free
language

Regular language

0

S2

S1

0

S0

0

1

0

1

87

Ex: To recognize a string of the form 0n1n

Limitation again

Can context free language recognize strings of the form 0n1n2n ? No

You're Reading a Free Preview

Download
scribd
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->