Pushdown Automaton: CFL and the pumping lemma

From CFG to PDA
• We define as follows (shorthand notation):
– (q start ,,)={(q loop ,S$)}
– (q loop ,,A)={(q loop , 1 … k ) | for each A 1 … k in R}
– (q loop ,a,a)={(q loop ,) | for each a }
– (q loop ,,$)={(q accpt, )}
{,A 1 … k | for rules A 1 … k }
{a,a | for all a}
,S$
,$
q start q loop q accpt
15