Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
Proof – condition 1<br />
• To prove condition 1 (|vy|>0) we have to show it<br />
is impossible that both v <strong>and</strong> y are .<br />
• We use a grammar without unit rules.<br />
• But <strong>the</strong> only way to have v=y=, is to have a<br />
rule R R, which is a unit rule. Contradiction.<br />
• So condition 1 is satisfied.<br />
S<br />
R<br />
R<br />
u v x y z<br />
41