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.
More information
More information
Related categories 1
Sites 3
A definition of NPDA with examples and a proof that NPDA accept 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.
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.
A definition of NPDA with examples and a proof that NPDA accept context free languages.
