Sanakirja.org

Määritelmät

Substantiivit

1. (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.