Definitions from Wiktionary (pushdown automaton)

▸ noun:  (computing theory) An automaton with finitely many states that can also use one unbounded stack of memory; the automaton may only push, pop, or read the top of the stack. Abbreviation: PDA.




▸ Words similar to pushdown automaton
▸ Usage examples for pushdown automaton

▸ Idioms related to pushdown automaton
▸ Wikipedia articles (New!)
▸ Words that often appear near pushdown automaton
▸ Rhymes of pushdown automaton

▸ Invented words related to pushdown automaton