Pushdown automaton (PDA) are finite state automata that can make use of a stack containing data. The state transitions for PDA involve the input symbol as well as the information available on the stack. The set of languages accepted by nondeterministic PDA is equivalent to the set of context free languages.
Related categories 1
Non-determinsitic Pushdown Automata
A definition of NPDA with examples and a proof that NPDA accept context free languages.
Notes for a linguistics course defining PDA and showing their relation to context free languages.
A site with a formal definition of PDA, some examples and a proof that PDA accept context free languages.
A Wikipedia article with a definition and simple example.
Last update:November 3, 2012 at 6:35:03 UTC