Pushdown Automata - Hampden-Sydney College
Pushdown Automata - Hampden-Sydney College
Pushdown Automata - Hampden-Sydney College
You also want an ePaper? Increase the reach of your titles
YUMPU automatically turns print PDFs into web optimized ePapers that Google loves.
The Grammar Rules (Group 1)<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 />
Example (Convert a PDA to a CFG)<br />
Find all pairs of transitions where<br />
The first transition pushes a symbol x.<br />
The second transition pops a symbol y.<br />
The rules:<br />
δ(p, ε, ε) = (q, $)<br />
δ(q, a, ε) = (q, a)<br />
δ(q, b, a) = (q, ε)<br />
δ(q, ε, $) = (r, ε)
Change language