Pushdown Automata - Hampden-Sydney College

Equivalence of PDAs and CFGs
Pushdown
Automata -
Equivalence
to CFGs
Robb T.
Koether
Homework
Review
Equivalence
of PDAs and
CFGs
Proof ⇒
Proof ⇐
Long Example
Short
Example
Assignment
Proof (⇒).
The transitions are
δ(q 0 , ε, ε) = {(q 1 , $)}
δ(q 1 , ε, ε) = {(q 2 , S)}
δ(q 2 , ε, A) = {(q 2 , w)}, where A → w is a rule.
δ(q 2 , a, a) = {(q 2 , ε)}, for all a ∈ Σ.
δ(q 2 , ε, $) = {(q 3 , ε)}
It is clear that L(M) = L(G).