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 (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 />
The pair<br />
δ(q, a, ε) = (q, a)<br />
δ(q, b, a) = (q, ε)<br />
gives the rules A qq → A qx A xq for all x ∈ Q.<br />
That is,<br />
A qq → A qp A pq<br />
A qq → A qq A qq<br />
A qq → A qr A rq
Change language