This article is about a self-operating machine. For other uses, see Automaton (disambiguation). For Automata, see Automata (disambiguation).
A postulated interior of the Duck of Vaucanson (1738–1739)Pinocchio automaton
An automaton (/ɔːˈtɒmətən/; pl.: automata or automatons) is a relatively self-operating machine, or control mechanism designed to automatically follow a sequence of operations, or respond to predetermined instructions.[1] Some automata, such as bellstrikers in mechanical clocks, are designed to give the illusion to the casual observer that they are operating under their own power or will, like a mechanical robot. The term has long been commonly associated with automated puppets that resemble moving humans or animals, built to impress and/or to entertain people.
Animatronics are a modern type of automata with electronics, often used for the portrayal of characters or creatures in films and in theme park attractions.
^"Definition of AUTOMATON". www.merriam-webster.com. 2024-01-04. Retrieved 2024-01-25.
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...
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...
particular in the theory of formal languages, a counter automaton, or counter machine, is a pushdown automaton with only two symbols, A {\displaystyle A} and the...
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...
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...
The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability...
"Californian Seventies funk rock". Jamiroquai released their 2017 album, Automaton, through Virgin EMI. It was their eighth studio album and the first in...
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...
In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set...
In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage...
complementation of an automaton[clarify] is the problem of computing an automaton that accepts precisely the words rejected by another automaton. Formally, given...
mechanical, wind-up figures called automata. Selznick decided to add an Automaton to the storyline after reading Gaby Wood's 2003 book Edison's Eve, which...
computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given...
minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here...
in formal language theory, a quotient automaton can be obtained from a given nondeterministic finite automaton by joining some of its states. The quotient...
automaton (ATA) is an extension of nondeterministic tree automaton as same as alternating finite automaton extends nondeterministic finite automaton (NFA)...
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...
Muller automaton is a type of an ω-automaton. The acceptance condition separates a Muller automaton from other ω-automata. The Muller automaton is defined...
A queue machine, queue automaton, or pullup automaton (PUA)[citation needed] is a finite state machine with the ability to store and retrieve data from...
Global Information
