Try Our Apps


World Series Quiz

deterministic automaton

deterministic automaton in Technology

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

The Free On-line Dictionary of Computing, © Denis Howe 2010
Cite This Source

Word of the Day

Word Value for deterministic

Scrabble Words With Friends

Nearby words for deterministic automaton