Assertion: pushdown automaton | /r/HasProperty | pda
Facets:
Source sentences:
text: In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
text: If, in every situation, at most one such transition action is possible, then the automaton is called a deterministic pushdown automaton (DPDA).
text: A pushdown automaton (PDA) differs from a finite state machine in two ways: