Pushdown Automaton

An automaton augmented with a last-in, first-out stack used as unbounded auxiliary memory; it recognizes exactly the languages that can be generated by context-free grammars (context-free languages) by applying state transitions together with push and pop operations on the stack.