push-down automaton

push-down automaton

[′pu̇sh‚dau̇n ȯ′täm·ə‚tän]
(computer science)
A nondeterministic, finite automaton with an auxiliary tape having the form of a push-down storage.
Mentioned in ?
References in periodicals archive ?
In the paper we introduce a biomolecular implementation of the push-down automaton (one of the theoretical models of computing devices with unbounded memory) using DNA molecules.
not tested in laboratory) of implementation of the push-down automaton built on DNA.
In this section we recall shortly the definition of the push-down automaton (PDA).
A push-down automaton is a finite automaton (nondeterministic) which has a stack, a kind of simple memory in which it can store information in a last-in-first-out fashion.