- pushdown stack
- noun see pushdown
New Collegiate Dictionary. 2001.
pushdown stack
Look at other dictionaries:
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
Stack machine — In computer science, a stack machine is a model of computation in which the computer s memory takes the form of one or more stacks. The term also refers to an actual computer implementing or simulating the idealized stack machine.In addition, a… … Wikipedia
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
pushdown — adjective Describing a stack in which items are removed in a LIFO manner from the end they were added … 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
Nested stack automaton — In automata theory, a nested stack automaton is a finite automaton that can make use of a stack containing data which can be additional stacks.[1] A nested stack automaton may read its stack, in addition to pushing or popping it. A nested stack… … 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
English Electric KDF9 — KDF9 was an early British computer designed and built by English Electric, later English Electric Leo Marconi, EELM, later still incorporated into ICL. It first came into service in 1964 and was still in use in 1980 in at least one installation.… … Wikipedia
