Pushdown Automata Automata Theory Theoretical Computer Science
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.
Top: Computers: Computer Science: Theoretical: Automata Theory: Pushdown Automata
See Also:
- Push-Down Automata - Notes for a linguistics course defining PDA and theoretical showing their theoretical relation to context free languages.
- Pushdown Automata and Context Free Languages - An article with basic definitions and a proof theoretical that the theoretical languages accepted by PDA are context theoretical free languages.
- Pushdown Automata - A site with a formal definition of PDA, theoretical some examples automata theory and a proof that PDA accept theoretical context free languages.
- Pushdown automaton - A Wikipedia article with a definition and simple example.
- Non-determinsitic Pushdown Automata - A definition of NPDA with examples and a automata theory proof that NPDA accept context free languages.
MySQL - Cache Direct
