Directory of Pushdown Automata Resources
Home > Computers > Computer Science > Theoretical > Automata Theory > Pushdown Automata
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.
Resources in This Category
-
Non-determinsitic Pushdown Automata
http://users.comlab.ox.ac.uk/luke.ong/teaching/moc/pda2up.pdf#search="pushdown automata"
A definition of NPDA with examples and a proof that NPDA accept context free languages. -
Push-Down Automata
http://web.uvic.ca/~ling48x/ling484/notes/pda.html
Notes for a linguistics course defining PDA and showing their relation to context free languages. -
Pushdown Automata
http://www.cs.nott.ac.uk/~txa/g51mal.2001/notes/node29.html
A site with a formal definition of PDA, some examples and a proof that PDA accept context free languages. -
Pushdown automaton
http://en.wikipedia.org/wiki/Pushdown_automaton
A Wikipedia article with a definition and simple example.
Related Categories
Home > Computers > Computer Science > Theoretical > Automata Theory > Pushdown Automata
Thanks to DMOZ, which built a great web directory for nearly two decades and freely shared it with the web. About us
