View source for Deterministic pushdown automata

In [[automata theory]], a '''deterministic pushdown automaton''' (DPDA or DPA) is a variation of the [[pushdown automaton]].

== Description ==

The class of deterministic pushdown automata accepts the [[Deterministic context-free language|deterministic context-free languages]], a proper subset of [[Context-free language|context-free languages]].

Machine transitions are based on the current state and input symbol, and also the current topmost symbol of the stack. Symbols lower in the stack are not visible and have no immediate effect. Machine actions include pushing, popping, or replacing the stack top.

A deterministic pushdown automaton has at most one legal transition for the same combination of input symbol, state, and top stack symbol. This is where it differs from the nondeterministic pushdown automaton.

== See also ==

* [[Automata theory]]
* [[Context-free language]]
* [[Deterministic context-free language]]
* [[Pushdown automaton]]

== External links ==

* [https://en.wikipedia.org/wiki/Deterministic_pushdown_automaton Deterministic pushdown automata] @ Wikipedia

[[Category:Computer science]]