For a different notion of tree automaton, see tree walking automaton.
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 following article deals with branching tree automata, which correspond to regular languages of trees.
As with classical automata, finite tree automata (FTA) can be either a deterministic automaton or not. According to how the automaton processes the input tree, finite tree automata can be of two types: (a) bottom up, (b) top down. This is an important issue, as although non-deterministic (ND) top-down and ND bottom-up tree automata are equivalent in expressive power, deterministic top-down automata are strictly less powerful than their deterministic bottom-up counterparts, because tree properties specified by deterministic top-down tree automata can only depend on path properties. (Deterministic bottom-up tree automata are as powerful as ND tree automata.)
A treeautomaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The...
An automaton (/ɔːˈtɒmətən/; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow...
of the automaton. Such an automaton is called a treeautomaton. Infinite tree input : The two extensions above can be combined, so the automaton reads...
theory, an alternating treeautomaton (ATA) is an extension of nondeterministic treeautomaton as same as alternating finite automaton extends nondeterministic...
computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories...
Nondeterministic finite treeautomaton, investigated in theoretical computer science and formal language theory, see Treeautomaton#Definitions Northern...
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...
In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal...
A tree stack automaton (plural: tree stack automata) is a formalism considered in automata theory. It is a finite state automaton with the additional...
has been generalized to infinite words (see ω-automata) and to trees (see treeautomaton). Rational set generalizes the notion (of regular/rational language)...
domain of a DTOP is a regular tree language. Furthermore, the domain is recognisable by a deterministic top-down treeautomaton (DTTA) of size at most exponential...
In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...
additional pebbles further increased power. A tree-walking automaton with nested pebbles is a tree-walking automaton with an additional finite set of fixed size...
Neumann's universal constructor. Nobili's cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells...
checking in comparison to a binary search trees.: 358 A trie can be seen as a tree-shaped deterministic finite automaton. Tries support various operations:...
children. Computer programming portal Prefix tree (also known as a Trie) Deterministic acyclic finite state automaton (DAFSA) Ternary search tries Hash trie...
Global Information