EPDAs and PDAs are Equivalent
Theorem: For every EPDA M, there is a PDA M’,
                  and L(M)f = L(M’)f.
Illustration:
=
The family of languages accepted by EPDAs
The family of languages accepted by PDAs
Proof: See page 419 in [Meduna: Automata and Languages]
38/50