pushdown automaton

Hierarchy: 
Description: 
{{computing theory}} 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.
Ngram Text: 
pushdown automaton
Source: 
Wiktionary
Issue: 
0
Wiktionary tag: 
Ngram Count: 
2