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

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

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

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

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

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

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

A reversible cellular automaton is a cellular automaton in which every configuration has a unique predecessor. That is, it is a regular grid of cells...

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 automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set...

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

automaton (ATA) is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton (NFA)...

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

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

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

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

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

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

Τάλως, Tálōs) or Talon (/ˈteɪlɒn, ən/; Greek: Τάλων, Tálōn), was a giant automaton made of bronze to protect Europa in Crete from pirates and invaders. He...

in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient...

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 second-order cellular automaton is a type of reversible cellular automaton (CA) invented by Edward Fredkin where the state of a cell at time t depends...

Hay 3:21 2. "I Can See It in Your Eyes" Hay 3:29 3. "Down Under" Hay, Ron Strykert 3:42 4. "Underground" Hay 3:03 5. "Helpless Automaton" Greg Ham 3:21...

A block cellular automaton or partitioning cellular automaton is a special kind of cellular automaton in which the lattice of cells is divided into non-overlapping...