# Deterministic automaton

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

< Previous Terms |
Terms Containing deterministic automaton |
Next Terms > |

DESQview destructor DESY DETAB deterministic |
probabilistic automaton |
DETOL developer development Developmental Test and Evaluation development environment |