NPTEL Video Course : Theory of Automata, Formal Languages and Computation

Lecture 21 - Pushdown Automata, Equivalence Between Acceptance by Empty Store and Acceptance by Final State