11.01.2015 Views

Pushdown Automaton: CFL and the pumping lemma

Pushdown Automaton: CFL and the pumping lemma

Pushdown Automaton: CFL and the pumping lemma

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

CFG=PDA<br />

• We have shown that a language is context-free<br />

iff some pushdown automaton recognizes it.<br />

• In particular all regular languages can be<br />

generated by CFGs <strong>and</strong> so can be recognized<br />

by PDA.<br />

• The class of languages accepted by nondeterministic<br />

PDAs is larger than those<br />

accepted by deterministic PDAs.<br />

29

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!