Search in: Word
Vietnamese keyboard: Off
Virtual keyboard: Show
Computing (FOLDOC) dictionary
nondeterministic automaton
Jump to user comments
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.