nondeterministic automaton

nondeterministic automaton

(theory)(Or "probabilistic automaton") An automaton inwhich there are several possible actions (outputs and nextstates) at each state of the computation such that the overallcourse of the computation is not completely determined by theprogram, the starting state, and the initial inputs.

See also nondeterministic Turing Machine.