Bazsites.com Pushdown Automata

Directory Topics

Automata - Course notes from the University of Kentucky with sections on finite state automata, pushdown automata and linear bounded automata.
Finite Automata With External Storage - Article discussing counter automata, pushdown automata and linear bounded automata and the relation between them.
Theory of Automata and Formal Languages - Survey of finite state automata, pushdown automata, Turing machines and the languages accepted by these devices.
Automata Theory - Wikipedia article on finite state machines with links to articles about pushdown automata, linear bounded automata and Turing machines.
Pushdown Automata - A site with a formal definition of PDA, some examples and a proof that PDA accept context free languages.
Pushdown Automata - Definitions and examples of deterministic and nondeterministic PDA and an example to show that the family of deterministic PDA is a proper subset of the family of nondeterministic PDA.
Pushdown Automata and Context Free Languages - An article with basic definitions and a proof that the languages accepted by PDA are 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 proof that NPDA accept context free languages.
Introduction to Pushdown Automata - A lecture describing the limitations of FSA, introducing PDA and context free grammars.

Deterministic pushdown automaton - In automata theory, a deterministic pushdown automaton is a deterministic finite state machine that can make use of a stack containing data.
Pushdown automaton - In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data.
Context-free language - A context-free language is a formal language that can be defined by a context-free grammar. The set of all context-free languages is identical to the set of languages accepted by pushdown automata.