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...

A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed...

infinite-tree automaton is a state machine that deals with infinite tree structures. It can be seen as an extension of top-down finite-tree automata to...

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...

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of...

finite automaton (DFA) deterministic finite state machine deterministic finite tree automaton deterministic pushdown automaton (DPDA) deterministic tree automaton...

An automaton (/ɔːˈtɒmətən/ ; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow...

Nondeterministic finite tree automaton, investigated in theoretical computer science and formal language theory, see Tree automaton#Definitions Nuova ferrovia...

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...

(psychology) Bottom-up theories of galaxy formation and evolution Bottom-up tree automaton, in data structures Bottom-up integration testing, in software testing...

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

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...

theory, an alternating tree automaton (ATA) is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic...

theorem involves the construction of a finite bottom-up tree automaton that acts on the tree decompositions of the given graph. In more detail, two graphs...

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...

automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...

has been generalized to infinite words (see ω-automata) and to trees (see tree automaton). Rational set generalizes the notion (of regular/rational language)...

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...

has a daughter, computer scientist Tal Rabin. Oblivious transfer Rabin automaton Rabin fingerprint Hyper-encryption List of Israel Prize recipients Shasha...

domain of a DTOP is a regular tree language. Furthermore, the domain is recognisable by a deterministic top-down tree automaton (DTTA) of size at most exponential...

example, the above definition is used in the definition of an infinite tree automaton. Let T = {0,1}* and Σ = {a,b}. We define a labeling function V as follows:...

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

branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite...

children. Computer programming portal Prefix tree (also known as a Trie) Deterministic acyclic finite state automaton (DAFSA) Ternary search tries Hash trie...

tree, this problem can be solved in linear time in the tree, by translating the Boolean MSO formula to a tree automaton and evaluating the automaton on...

as a (potentially infinite) boolean-labelled tree (see also tree (set theory) and infinite-tree automaton). Each possible string w ∈ Σ ∗ {\displaystyle...

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...

only to become embroiled in a mystery surrounding his late father's automaton and the pioneering filmmaker Georges Méliès. Hugo is Scorsese's first...

alternating timed automaton (ATA) is a modeling formalism that combines features of timed automaton and an alternating finite automaton to succinctly express...