deterministic automaton

(theory)A finite-state automaton in which the overallcourse of the computation is completely determined by theprogram, the starting state, and the initial inputs. Theclass of problems solvable by such automata is the class P(see polynomial-time algorithm).

Deterministic Automaton

a mathematical model of a system whose states change discretely with time in such a way that every state of the system is completely defined by the previous state and the input signal. A deterministic automaton is formally described in the form of the function f(S_i, a_j) = a_k, where s_i is the input signal and a_j is the previous state. A typical example of a deterministic automation is a digital computer, in which the state of all registers and cells is determined by their previous state and by the input signals. Deterministic automatons are a natural form for describing the logical structure of discrete computing devices. Conversion to nondeterministic automatons is possible both by the introduction of the probabilities of a change of states and by the free selection of the next state.

单词	deterministic automaton
释义	deterministic automaton deterministic automaton (theory)A finite-state automaton in which the overallcourse of the computation is completely determined by theprogram, the starting state, and the initial inputs. Theclass of problems solvable by such automata is the class P(see polynomial-time algorithm). Deterministic Automaton a mathematical model of a system whose states change discretely with time in such a way that every state of the system is completely defined by the previous state and the input signal. A deterministic automaton is formally described in the form of the function f(S_i, a_j) = a_k, where s_i is the input signal and a_j is the previous state. A typical example of a deterministic automation is a digital computer, in which the state of all registers and cells is determined by their previous state and by the input signals. Deterministic automatons are a natural form for describing the logical structure of discrete computing devices. Conversion to nondeterministic automatons is possible both by the introduction of the probabilities of a change of states and by the free selection of the next state.
随便看	telescope house telescope into telescope it into telescope mounting telescopes telescope shell telescope sight telescope something into telescope structure telescope support telescope user interface telescopic telescopic alidade telescopically telescopic antenna telescopic binary telescopic comet telescopic denture telescopic derrick telescopic lens telescopic loading trough telescopic object telescopic pixel display telescopic series telescopic sight