A tree stack automaton (plural: tree stack automata) is a formalism considered in automata theory. It is a finite-state automaton with the additional...

of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about...

A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The...

automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton...

In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query...

grammar-parsing pushdown automaton, but instead of using a plain stack to store symbols, it has a stack of iterated stacks that store symbols, giving...

of the automaton. Such an automaton is called a tree automaton. Infinite tree input : The two extensions above can be combined, so the automaton reads...

cell, mark it as visited and push it to the stack While the stack is not empty Pop a cell from the stack and make it a current cell If the current cell...

pebbles further increased power. A tree-walking automaton with nested pebbles is a tree-walking automaton with an additional finite set of fixed size containing...

cannot be balanced. For every regular language there is a finite-state automaton (FSA) that accepts the language. The number of states in such an FSA are...

can be seen as a special kind of regular tree grammar, describing a set of single-path trees. A regular tree grammar G is defined by the tuple G = (N...

Variable-length strings (of finite length) can be viewed as nodes on a perfect k-ary tree. Infinite strings (otherwise not considered here) can be viewed as infinite...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

visibly pushdown automaton is a restriction of the one used for pushdown automata. Visibly pushdown automata only add a symbol to the stack when reading a...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

stack, return the value of the last element added. The name stack is an analogy to a set of physical items stacked one atop another, such as a stack of...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

salesman bottom-up tree automaton boundary-based representation bounded error probability in polynomial time bounded queue bounded stack Bounding volume...

Equivalently, it is a language recognised by a local automaton, a particular kind of deterministic finite automaton. Formally, a language L over an alphabet A is...

recovery. LR parser stack usually stores just the LR(0) automaton states, as the grammar symbols may be derived from them (in the automaton, all input transitions...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

expression Regular grammar Prefix grammar Tree automaton Pushdown automaton Context-free grammar Büchi automaton Chomsky hierarchy Context-sensitive language...

functions Lambda calculus Concurrent models include: Actor model Cellular automaton Interaction nets Kahn process networks Logic gates and digital circuits...

Decider Linear-bounded PTIME Turing Machine Nested stack Thread automaton restricted Tree stack automaton Embedded pushdown Nondeterministic pushdown Deterministic...

automata theory, a tagged deterministic finite automaton (TDFA) is an extension of deterministic finite automaton (DFA). In addition to solving the recognition...

weight of the root node. Definition: Create a stack S and a list L. Traverse down the left-most spine of the tree until you reach a leaf l', adding each node...

polynomial". In Paul Franchi-Zannettacci (ed.). Proc. 11th Colloquium on Trees in Algebra and Programming (CAAP) (PDF). LNCS. Vol. 214. Springer. pp. 85–99...

size. As a result, this does not make the automaton more powerful, but is a convenient abstraction. The stack alphabet is Γ = N ∪ Σ {\displaystyle \Gamma...

nondeterministic tree automaton (see tree automaton and infinite-tree automaton). An infinite tree automaton starts at the root and moves up the tree, and accepts...