(theory) | deterministic automaton - A finite-state automaton in which the overall
course of the computation is completely determined by the
program, the starting state, and the initial inputs. The
class of problems solvable by such automata is the class P
(see polynomial-time algorithm). |

Browse

Determinate quantities

Determinately

Determinateness

Determination

Determinative

Determinative tables

Determinator

Determine

Determined

Determinedly

Determiner

determining

determining factor

Determinism

Determinist

deterministic

**-- deterministic automaton --**

Deterration

Deterrence

Deterrent

deterrent example

Detersion

Detersive

Detersively

Detersiveness

Detest

Detestability

Detestable

Detestableness

Detestably

Detestate

Detestation

detested

Determinately

Determinateness

Determination

Determinative

Determinative tables

Determinator

Determine

Determined

Determinedly

Determiner

determining

determining factor

Determinism

Determinist

deterministic

Deterration

Deterrence

Deterrent

deterrent example

Detersion

Detersive

Detersively

Detersiveness

Detest

Detestability

Detestable

Detestableness

Detestably

Detestate

Detestation

detested