|
|
Definition of Pushdown automaton
1. Noun. (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. ¹
¹ Source: wiktionary.com
Lexicographical Neighbors of Pushdown Automaton
Other Resources:
