You are here: irt.org | FOLDOC | nondeterministic automaton

<*theory*> (Or "probabilistic automaton") An automaton in
which there are several possible actions (outputs and next
states) at each state of the computation such that the overall
course of the computation is not completely determined by the
program, the starting state, and the initial inputs.

See also nondeterministic Turing Machine.

(1996-05-07)

Nearby terms: non-constructive proof « nondeterminism « nondeterministic « **nondeterministic automaton** » nondeterministic polynomial time » Nondeterministic Turing Machine » non-impact printer

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