An automaton (/ɔːˈtɒmətən/; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow...

A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...

of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees...

computation, a branch of theoretical computer science, a pushdown automaton (PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories...

The Mechanical Turk, also known as the Automaton Chess Player (German: Schachtürke, lit. 'chess Turk'; Hungarian: A Török), or simply The Turk, was a...

automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton...

A finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model of...

Look up automaton in Wiktionary, the free dictionary. An automaton is a self-operating machine. Automaton may also refer to: An automaton, an abstract...

automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...

In computer science, a deterministic automaton is a concept of automata theory where the outcome of a transition from one state to another is determined...