DETERMINISTIC AUTOMATON

Domain	Definition
Computing	Deterministic automaton A finite-state automaton in which the overall course of the computation is completely determined by the program, the starting state, and the initial inputs. The class of problems solvable by such automata is the class P (see polynomial-time algorithm). (1996-05-03). Source: The Free On-line Dictionary of Computing.
Source: compiled by the editor from various references; see credits.

Anagrams: DETERMINISTIC AUTOMATON

Scrabble® YAWL-Verified Anagrams
	Words within the letters "a-a-c-d-e-e-i-i-i-m-m-n-n-o-o-r-s-t-t-t-t-u"
	-5 letters: documentarisation.
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.

Alternative Orthography: DETERMINISTIC AUTOMATON

Hexadecimal (or equivalents, 770AD-1900s) (references)

Leonardo da Vinci (1452-1519; backwards) (references)

Binary Code (1918-1938, probably earlier) (references)

HTML Code (1990) (references)

ISO 10646 (1991-1993) (references)

Encryption (beginner's substitution cypher): (references)

Specialty Definition: DETERMINISTIC AUTOMATON