Wikidata facts
- Named after
- automated machine
Show 3 more facts
- Commons category
- Pushdown automata
- uses
- stack
- studied by
- automata theory
Sources (2)
via Wikidata · CC0
~22 min read
Encyclopedic overview
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
Pushdown automata are used in theories about what can be computed by machines. They are more capable than finite-state machines but less capable than Turing machines (see below). Deterministic pushdown automata can recognize all deterministic context-free languages while nondeterministic ones can recognize all context-free languages, with the former often used in parser design.
Excerpted from Wikipedia’s “pushdown automaton” article, available under the CC BY-SA 4.0 licence.