(theory) | nondeterministic automaton - (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. |

Browse

noncrystalline

noncurrent

noncyclic

noncyclical

Nonda

Nondecane

Nondeciduate

nondecisive

nondeductible

Nondelivery

nondenominational

Nondeposition

nondepository financial institution

nondescript

nondeterminism

nondeterministic

**-- nondeterministic automaton --**

nondeterministic polynomial time

Nondeterministic Turing Machine

Nondevelopment

nondigestible

nondirectional antenna

Nondiscovery

nondiscretionary trust

nondiscrimination

nondisjunction

nondisposable

Nondo

nondrinker

nondriver

nondurable

None

None of

noncurrent

noncyclic

noncyclical

Nonda

Nondecane

Nondeciduate

nondecisive

nondeductible

Nondelivery

nondenominational

Nondeposition

nondepository financial institution

nondescript

nondeterminism

nondeterministic

nondeterministic polynomial time

Nondeterministic Turing Machine

Nondevelopment

nondigestible

nondirectional antenna

Nondiscovery

nondiscretionary trust

nondiscrimination

nondisjunction

nondisposable

Nondo

nondrinker

nondriver

nondurable

None

None of