Sanakirja
Tekoälykääntäjä
KieliKäännökset
saksaKellerautomat
suomipinoautomaatti
tšekkizásobníkový automat

Määritelmät

Substantiivi

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

Taivutusmuodot

Monikkopushdown automata
Monikkopushdown automatons

Luokat


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

Automata theory.

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

A diagram of a pushdown automaton

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

a step of the pushdown automaton