You are here: irt.org | FOLDOC | 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).

(1996-05-03)

Nearby terms: DESY « DETAB « deterministic « **deterministic automaton** » DETOL » developer » development

FOLDOC, Topics, A, B, C, D, E, F, G, H, I, J, K, L, M, N, O, P, Q, R, S, T, U, V, W, X, Y, Z, ?, ALL