TREE CONTRACTION

Domain	Definition
Math	A tree automaton is an extension of a finite state machine, but operates on n-ary constructors. Where a finite state automaton reaches a new state with a single state and character, a tree automaton takes n states and constructors. Tree automata may be top-down (starting from the root) or bottom-up (starting from the leaves), and deterministic or nondeterministic. (references)
Source: compiled by the editor from various references; see credits.

Anagrams: TREE CONTRACTION

Scrabble® Enable2K-Verified Anagrams
	Words within the letters "a-c-c-e-e-i-n-n-o-o-r-r-t-t-t"
	-3 letters: concentrator.
	-4 letters: areocentric, concentrate, contraction, reconnoiter, reconnoitre, retroaction.
	-5 letters: concertina, concertino, concretion, contractor, correction, interocean, nonreactor, recreation, retraction.
	Words containing the letters "a-c-c-e-e-i-n-n-o-o-r-r-t-t-t"
	+5 letters: anthropocentricities.
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.