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.



< Previous Terms Terms Containing nondeterministic automaton Next Terms >
NOMEX underwear
Nominal Semidestructor
non-algorithmic procedure
nondeterminism
nondeterministic
 probabilistic automaton
 nondeterministic polynomial time
Nondeterministic Turing Machine
non-impact printer
non-interlaced
nonintrusive testing