A finite state machine augmented with a stack of unbounded size, giving it the extra memory needed to recognize context-free languages, the class of languages that most programming-language grammars belong to.
Facts
Core PrincipleGiven an input symbol, current state and stack symbol, the automaton follows a transition to another state and optionally pushes or pops the stack. 1 Connections
Sources
1. Pushdown automaton - Wikipedia
Informal description
Put together: Given an input symbol, current state, and stack symbol, the automaton can follow a transition to another state, and optionally manipulate (push or pop) the stack.
In Group: Models of Computation and Automata, Lead
In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
View the SourceReader Challenges (0)
No disputes yet. Spotted an error or a better source? Open the first one.
Sign in to dispute this or suggest a correction.