Pushdown Automata (PDA)
- tags
- Automata Theory
What?
- The PDA is an automaton equivalent to the Context Free Grammar (CFG) in language-defining power.
- Generalization of Finite Automata
- Think of an ε-NFA with the additional power that it can manipulate a stack. It can use the stack to help choose the next move.
