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<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 />
This gives us the grammar rules<br />
A pq → A pp A pq<br />
A pq → A pq A qq<br />
A pr → A pp A pr<br />
A pr → A pq A qr<br />
A pr → A pr A rr<br />
A qq → A qq A qq<br />
A qr → A qq A qr<br />
A qr → A qr A rr<br />
A pr → A qq<br />
A qq → aA qq b<br />
A pp → ε<br />
A qq → ε<br />
A rr → ε
Change language