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...

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

The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability...

In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set...

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

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...

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...

In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Such...

and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and...

A network automaton (plural network automata) is a mathematical system consisting of a network of nodes that evolves over time according to predetermined...

Maillardet's automaton (or Draughtsman-Writer, Maelzel's Juvenile Artist, Juvenile Artist) is an automaton built in London c. 1800 by a Swiss mechanician...

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...

Automaton Transfusion is a 2006 American independent horror film written and directed by Steven C. Miller. In the early 1970s, while the majority of Americans...

branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite...

A tree automaton is a type of state machine. Tree automata deal with tree structures, rather than the strings of more conventional state machines. The...

Automaton is the eighth studio album by English funk band Jamiroquai, released on 31 March 2017 through Virgin EMI. It is the band's first album in seven...

theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input. A two-way deterministic finite automaton (2DFA) is an abstract...

In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal...

In computer science, a Levenshtein automaton for a string w and a number n is a finite-state automaton that can recognize the set of all strings whose...

base of the automaton, which produces the necessary movement to complete seven sketches and the text. It is believed that this automaton has the largest...

"Californian Seventies funk rock". Jamiroquai released their 2017 album, Automaton, through Virgin EMI. It was their eighth studio album and the first in...

complementation of an automaton[clarify] is the problem of computing an automaton that accepts precisely the words rejected by another automaton. Formally, given...

computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given...

which they denied any involvement with The Exit 9. Verity Townsend from Automaton Media speculated that the developers of the copycat were taking advantage...

method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) which recognizes the same formal language...

In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...