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<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 complete grammar is<br />
A pr → A pp A pr | A pq A qr | A pr A rr | A qq<br />
A pp → ε<br />
A pq → A pp A pq | A pq A qq<br />
A qq → aA qq b | A qq A qq | ε<br />
A qr → A qq A qr | A qr A rr<br />
A rr → ε.
Change language