from Wiktionary, Creative Commons Attribution/Share-Alike License
- n. 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.
Sorry, no etymologies found.
Sorry, no example sentences found.
Wordnik is becoming a not-for-profit! Read our announcement here.