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.
Group 2 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 />
There is 1 combination of transitions that pushes and<br />
pops $.<br />
There are 9 combinations of transitions that push and<br />
pop (.<br />
So there are 10 rules in Group 2.<br />
A pu → A qs<br />
A qs → (A qr<br />
A qs → (A qs )<br />
A qq → (A qt<br />
A qs → aA rr<br />
A qs → aA rs )<br />
A qq → aA rt<br />
A ss → +A tr<br />
A ss → +A ts )<br />
A sq → +A tt
Change language