**pushdown** — noun Date: 1961 a store of data (as in a computer) from which the most recently stored item must be the first retrieved called also pushdown list, pushdown stack … New Collegiate Dictionary

**pushdown** — ˈ ̷ ̷ ˌ ̷ ̷ noun ( s) Etymology: push down, verb : a store of data (as in a computer) from which the item stored last must be the first retrieved called also pushdown list pushdown stack … Useful english dictionary

**Pushdown automaton** — In automata theory, a pushdown automaton (PDA) is a finite automaton that can make use of a stack containing data. Operation Pushdown automata differ from normal finite state machines in two ways: # They can use the top of the stack to decide… … Wikipedia

**pushdown list** — noun see pushdown … New Collegiate Dictionary

**pushdown stack** — noun see pushdown … New Collegiate Dictionary

**pushdown list** — dėklinis sąrašas statusas T sritis automatika atitikmenys: angl. last in first out list; LIFO list; push down list; pushdown list vok. LIFO Liste, f; Liste nach dem Kellerungsprinzip, f; Push Down Liste, f; Rückstelliste, f rus. магазинный список … Automatikos terminų žodynas

**pushdown automaton** — noun 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 … Wiktionary

**Deterministic pushdown automaton** — In automata theory, a pushdown automaton is a finite automaton with an additional stack of symbols; its transitions can take the top symbol on the stack and depend on its value, and they can add new top symbols to the stack. A deterministic… … Wikipedia

**Embedded pushdown automaton** — An embedded pushdown automaton or EPDA is a computational model that parse languages in the tree adjoining grammar (TAG). It is similar to the context free grammar parsing pushdown automaton, except that instead of using a stack (data structure)… … Wikipedia

**Nested word** — In computer science, more specifically in automata and formal language theory, nested words are a concept proposed by Alur and Madhusudan as a joint generalization of words, as traditionally used for modelling linearly ordered structures, and of… … Wikipedia