Pushdown automaton

In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is 
a type of automaton that employs a stack.


In the theory of computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack.
Read article on Wikipedia