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.
L={a i b i c i |i0}<br />
Case 2: v or y contain two types of alphabet<br />
symbols. (Cannot have three because<br />
condition 2 holds). So if we choose i=2 <strong>the</strong>n<br />
<strong>the</strong> order of <strong>the</strong> symbols in v 2 or y 2 was<br />
destroyed <strong>and</strong> w 2 =uv 2 xy 2 z L.<br />
Conclusion: The assumption that L is contextfree<br />
is false. <strong>and</strong> L={a n b n c n |n0} is not <strong>CFL</strong>.<br />
49