An automaton with finitely many states that also can use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA
pushdown
Aussprache
Etymologie
[ -"daun ] (noun.) 1961. By analogy with a spring-loaded stack of plates in a cafeteria.