Pushdown Automata - Hampden-Sydney College
Pushdown Automata - Hampden-Sydney College
Pushdown Automata - Hampden-Sydney College
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
The Grammar Rules<br />
<strong>Pushdown</strong><br />
<strong>Automata</strong> -<br />
Equivalence<br />
to CFGs<br />
Robb T.<br />
Koether<br />
Homework<br />
Review<br />
Equivalence<br />
of PDAs and<br />
CFGs<br />
Proof ⇒<br />
Proof ⇐<br />
Long Example<br />
Short<br />
Example<br />
Assignment<br />
Proof (⇐).<br />
For the rules in Group 1, use all pairs of transitions<br />
where the first transition pushes a symbol and the<br />
second transition pops a symbol, whether or not they<br />
are the same symbol.<br />
For each such pair of transitions δ(p, a, ε) = (s, c) and<br />
δ(t, b, d) = (q, ε), write the rules<br />
A pq → A pr A rq<br />
for all intermediate states r ∈ Q.
Change language