TREE AUTOMATON

Domain	Definition
Math	(1) A data structure accessed beginning at the root node. Each node is either a leaf or an internal node. An internal node has one or more child nodes and is called the parent of its child nodes. All children of the same node are siblings. Contrary to a physical tree, the root is usually depicted at the top of the structure, and the leaves are depicted at the bottom. (2) A connected, undirected, acyclic graph. It is rooted and ordered unless otherwise specified. (references)
Source: compiled by the editor from various references; see credits.

Specialty Definition: Tree automaton

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

See http://www.grappa.univ-lille3.fr/tata

Crosswords: TREE AUTOMATON

Specialty definitions using "TREE AUTOMATON": tree contraction. (references)

Source: compiled by the editor from various references; see credits.

Anagrams: TREE AUTOMATON

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-a-e-e-m-n-o-o-r-t-t-t-u"
	-3 letters: attenuator, autorotate.
	-4 letters: attenuate, automaton, neuromata, tonometer, treatment.
	-5 letters: aeronaut, amaretto, amoretto, anteater, anteroom, automate, emanator, maturate, numerate, outeaten, roomette, routeman, routemen, tattooer, tautomer, teetotum, teratoma.
Source: compiled by the editor from various references; see credits. SCRABBLE® is a registered trademark. All intellectual property rights in and to the game are owned in the U.S.A and Canada by Hasbro Inc., and throughout the rest of the world by J.W. Spear & Sons Limited of Maidenhead, Berkshire, England, a subsidiary of Mattel Inc. Mattel and Spear are not affiliated with Hasbro.