nondeterministic automaton

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.
References in periodicals archive ?
ix) A nondeterministic automaton can have more than one possible path for an input sequence.
To clarify how nondeterministic models work, mainly their acceptance mechanism, the CM unit uses the magic coin metaphor, introduced by Harel (1987): Students are told that they should think of a nondeterministic automaton as if it were equipped with a coin which it flips before it decides which transition to choose.
It should be emphasized that we did not ask the students specifically to construct a nondeterministic automaton, so they had the freedom of choice.
For the second sublanguage, he designed a fully nondeterministic automaton (Figure 19).
The skeleton of the automaton designed by Larry (Figure 23) is very similar in its structure to the natural nondeterministic automaton for this language, only this automaton is deterministic.
An alternative and very useful way to consider the problem is to model the search with a nondeterministic automaton (NFA).
There are two main trends: parallelize the work of the nondeterministic automaton that solves the problem (Figure 15), or parallelize the work of the dynamic programming matrix.
Notice that if we convert the nondeterministic automaton to a deterministic one with O(n) search time, we get an improved version of the KMP algorithm [Knuth et al.
We can represent the transition relation [Delta] of a nondeterministic automaton on binary trees using [[Beta].
r] can correspond to the same node of T; in contrast, in a run of a nondeterministic automaton over <T, V>, there is a one-to-one correspondence between the nodes of the run and the nodes of the tree.
Note that a nondeterministic automaton can have many runs on w.
r] can correspond to the same node of T; in contrast, in a run of a nondeterministic automaton on <T, V> there is a one-to-one correspondence between the nodes of the run and the nodes of the input tree.

Full browser ?