Wikidata facts
Show 1 more fact
- Commons category
- Pushdown automata
Sources (2)
via Wikidata · CC0
~22 min read
Article
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.
Connections
stack
Entity
regular language
Entity
context-sensitive language
Entity
deterministic pushdown automaton
Entity
International Standard Book Number
Entity
digital object identifier
Entity
International Standard Serial Number
Entity
palindrome
Entity
Turing machine
Entity
subset
Entity
formal language
Entity
if and only if
Entity
string
Entity
theory of computation
Entity
theoretical computer science
Entity
finite-state machine
Entity
automata theory
Entity
parsing
Entity
Chomsky hierarchy
Entity
formal grammar
Entity