Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
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 />
Theorem: A language is context-free iff<br />
some pushdown automaton recognizes it.<br />
Proof:<br />
• <strong>CFL</strong>PDA: we show that if L is <strong>CFL</strong><br />
<strong>the</strong>n a PDA recognizes it.<br />
• PDA <strong>CFL</strong>: we show that if a PDA<br />
recognizes L <strong>the</strong>n L is <strong>CFL</strong>.<br />
5
Change language