Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Pushdown Automaton: CFL and the pumping lemma
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
Example:<br />
• Construct a PDA for <strong>the</strong> following CFG G:<br />
SaTb | b<br />
TTa | <br />
L(G)= a * b<br />
,SaTb<br />
,Sb<br />
,TTa<br />
,T<br />
a,a<br />
b,b<br />
,S$<br />
,$<br />
q start q loop q accpt<br />
16