AI & ChatGPT searches , social queries for AUTOMATON
Search references for AUTOMATON. Phrases containing AUTOMATON
See searches and references containing AUTOMATON!
Search references for AUTOMATON. Phrases containing AUTOMATON
See searches and references containing AUTOMATON!AUTOMATON
Self-operating machine
An automaton (/ɑːˈtɑːmətɑːn/ ; pl.: automata or automatons) is a relatively self-operating machine or control mechanism designed to automatically follow
Automaton
Study of abstract machines and automata
of automaton. This automaton consists of states (represented in the figure by circles) and transitions (represented by arrows). As the automaton sees
Automata_theory
Discrete model of computation
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called
Cellular_automaton
Topics referred to by the same term
Look up automaton in Wiktionary, the free dictionary. An automaton is a self-operating machine. Automaton may also refer to: An automaton, an abstract
Automaton_(disambiguation)
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
Deterministic_automaton
Finite-state machine in automata theory
In automata theory, a permutation automaton, or pure-group automaton, is a deterministic finite automaton such that each input symbol permutes the set
Permutation_automaton
Muller automaton is a type of an ω-automaton. The acceptance condition separates a Muller automaton from other ω-automata. The Muller automaton is defined
Muller_automaton
Type of automaton
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
Pushdown_automaton
2017 studio album by Jamiroquai
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_(album)
Finite-state machine
automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state automaton
Deterministic finite automaton
Deterministic_finite_automaton
Automaton at the Franklin Institute, Philadelphia, US
Maillardet's automaton (or Draughtsman-Writer, Maelzel's Juvenile Artist, Juvenile Artist) is an automaton built in London c. 1800 by a Swiss mechanician
Maillardet's_automaton
Mathematical model of computation
science, a finite-state machine (FSM) or finite-state automaton (FSA, plural: automata), finite automaton, or simply a state machine, is a mathematical model
Finite-state_machine
Mathematical model for string comparison
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
Levenshtein_automaton
Mathematics concept
and computability theory, an elementary cellular automaton is a one-dimensional cellular automaton where there are two possible states (labeled 0 and
Elementary_cellular_automaton
Computation model, equivalent to Turing machines
A queue machine, queue automaton, or pullup automaton is a finite-state machine with the ability to store and retrieve data from an infinite-memory queue
Queue_automaton
computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given
Probabilistic_automaton
automata theory, a generalized Büchi automaton is a variant of a Büchi automaton. The difference with the Büchi automaton is the accepting condition, which
Generalized_Büchi_automaton
Chess-playing automaton hoax (1770–1854)
Mechanical Turk (German: Schachtürke, lit. 'chess Turk'), also known as the Automaton Chess Player or simply the Turk (Hungarian: A Török), was a chess-playing
Mechanical_Turk
A tree-walking automaton (TWA) is a type of finite automaton that deals with tree structures rather than strings. The concept was originally proposed
Tree-walking_automaton
Automaton which either accepts or rejects infinite inputs
In computer science and automata theory, a deterministic Büchi automaton is a theoretical machine which either accepts or rejects infinite inputs. Such
Büchi_automaton
Pattern that has no predecessors
In a cellular automaton, a Garden of Eden is a configuration that has no predecessor. It can be the initial configuration of the automaton but cannot arise
Garden of Eden (cellular automaton)
Garden_of_Eden_(cellular_automaton)
In computer science, a pebble automaton is any variant of an automaton which augments the original model with a finite number of "pebbles" that may be
Pebble_automaton
Mathematical model
A timed automaton is a mathematical model in automata theory that extends finite automata with a finite set of real-valued clocks. This formalism, introduced
Timed_automaton
Mobile automaton (plural: mobile automata) within theoretical computer science, is a class of automata similar to cellular automata but which have a single
Mobile_automaton
Variation of a finite automaton that runs on infinite input
branch of theoretical computer science, an ω-automaton (or stream automaton) is a variation of a finite automaton that runs on infinite, rather than finite
Ω-automaton
English acid jazz band
"Californian Seventies funk rock". Jamiroquai released their 2017 album, Automaton, through Virgin EMI. It was their eighth studio album and the first in
Jamiroquai
Elementary cellular automaton
The Rule 110 cellular automaton (often called simply Rule 110) is an elementary cellular automaton with interesting behavior on the boundary between stability
Rule_110
Type of finite-state machine in automata theory
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source
Nondeterministic finite automaton
Nondeterministic_finite_automaton
Abstract machine in computer science
automata theory, a deterministic pushdown automaton (DPDA or DPA) is a variation of the pushdown automaton. The class of deterministic pushdown automata
Deterministic pushdown automaton
Deterministic_pushdown_automaton
A continuous automaton can be described as a cellular automaton extended so that the valid states a cell can take are not just discrete (for example, the
Continuous_automaton
Kind of cellular automaton
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
Block_cellular_automaton
Cellular automaton that can be run backwards
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
Reversible_cellular_automaton
In automata theory, an alternating finite automaton (AFA) is a nondeterministic finite automaton whose transitions are divided into existential and universal
Alternating_finite_automaton
Mathematical structure
In computer science and mathematical logic, an infinite-tree automaton is a state machine that deals with infinite tree structures. It can be seen as
Infinite-tree_automaton
Giant automaton in Greek mythology
Giant automaton in Greek mythology
Talos
2011 American adventure drama film
only to become embroiled in a mystery surrounding his late father's automaton and the pioneering filmmaker Georges Méliès. Hugo is Scorsese's first
Hugo_(film)
Term in distributed computing
most types of an asynchronous concurrent system. On its own, the I/O automaton model contains a very basic structure that enables it to model various
Input/output_automaton
Hierarchy of classes of formal grammars
four types of grammars, the class of language it generates, the type of automaton that recognizes it, and the form its rules must have. The classes are
Chomsky_hierarchy
2017 single by Jamiroquai
"Automaton" is a song by the English funk band Jamiroquai. It was released as the lead single from their eighth album, Automaton (2017), on 27 January
Automaton_(song)
Deterministic finite automaton accepting set of all suffixes of particular string
In computer science, a suffix automaton is an efficient data structure for representing the substring index of a given string which allows the storage
Suffix_automaton
Type of finite automaton in automata theory
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
Two-way_finite_automaton
Method in computational solid mechanics based on the discrete concept
The movable cellular automaton (MCA) method is a method in computational solid mechanics based on the discrete concept. It provides advantages both of
Movable_cellular_automaton
An aperiodic finite-state automaton (also called a counter-free automaton) is a finite-state automaton whose transition monoid is aperiodic. A regular
Aperiodic finite-state automaton
Aperiodic_finite-state_automaton
1897 film by Georges Méliès
Gugusse and the Automaton (French: Gugusse et l'Automate), also known as The Clown and the Automaton, is an 1897 French short silent film directed by Georges
Gugusse_and_the_Automaton
Type of Turing machine
In computer science, a linear bounded automaton (abbreviated LBA) is a restricted form of Turing machine that functions as a more accurate model of a
Linear_bounded_automaton
2006 American film
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
Automaton_Transfusion
In automata theory, a hybrid automaton (plural: hybrid automata or hybrid automatons) is a mathematical model for precisely describing hybrid systems
Hybrid_automaton
18th-century automaton
The Vaucanson Automat Flute Player is an android automaton playing the transverse flute, designed and produced by Jacques de Vaucanson and presented to
Vaucanson_Flute_Player
alternating timed automaton (ATA) is a modeling formalism that combines features of timed automaton and an alternating finite automaton to succinctly express
Alternating_timed_automaton
2026 multiplayer video game
stealthily blend in with the background using colored backgrounds.]. Automaton (in Japanese). Archived from the original on June 16, 2026. Retrieved
Meccha_Chameleon
In automata theory, the thread automaton (plural: automata) is an extended type of finite-state automata that recognizes a mildly context-sensitive language
Thread_automaton
2012 studio album by Sybreed
God Is an Automaton is the fourth album by industrial metal band Sybreed. The album was released on 24 September 2012 in Europe and 2 October 2012 in
God_Is_an_Automaton
A tree stack automaton (plural: tree stack automata) is a formalism considered in automata theory. It is a finite-state automaton with the additional ability
Tree_stack_automaton
Type of clock featuring automatons
An automaton clock or automata clock is a type of striking clock featuring automatons. Clocks like these were built from the 1st century BC through to
Automaton_clock
State machine for tree structures
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
Tree_automaton
Machine learning algorithm
A learning automaton is one type of machine learning algorithm studied since 1970s. Learning automata select their current action based on past experiences
Learning_automaton
Psycho was an automaton created by John Nevil Maskelyne with the assistance of John Algernon Clarke and first shown to audiences at The Egyptian Hall
Psycho_(automaton)
2007 children's novel by Brian Selznick
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
The_Invention_of_Hugo_Cabret
Method for making finite automata deterministic
method for converting a nondeterministic finite automaton (NFA) into a deterministic finite automaton (DFA) that recognizes the same formal language.
Powerset_construction
Type of cellular automaton with similarities to Conway's Game of Life
A cellular automaton (CA) is Life-like (in the sense of being similar to Conway's Game of Life) if it meets the following criteria: The array of cells
Life-like_cellular_automaton
Chess-playing "pseudo-automaton" built in 1876
Mephisto was a 19th-century pseudo-automaton chess player built in London by the Alsatian artificial limb maker Charles Godfrey Gumpel (c. 1835–1921)
Mephisto_(automaton)
Abstract machines which have a continuum of locations with finite states
spatial automaton is a type of computer model studied in automata theory, a subfield of computer science. It is similar to a cellular automaton, in that
Continuous_spatial_automaton
Abstract machine model in computer science
automaton (UFA) is a nondeterministic finite automaton (NFA) such that each word has at most one accepting path. Each deterministic finite automaton (DFA)
Unambiguous_finite_automaton
Task of transforming a deterministic finite automaton
minimization is the task of transforming a given deterministic finite automaton (DFA) into an equivalent DFA that has a minimum number of states. Here
DFA_minimization
2D cellular automaton devised by Edgar F. Codd in 1968
Codd's cellular automaton is a cellular automaton (CA) devised by the British computer scientist Edgar F. Codd in 1968. It was designed to recreate the
Codd's_cellular_automaton
2023 video game
which they denied any involvement with The Exit 9. Verity Townsend from Automaton West speculated that the developers of the copycat were taking advantage
The_Exit_8
Swiss mechanician (1745–1830)
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
Henri_Maillardet
Two-dimensional cellular automaton
of Life, (sometimes abbreviated as CGoL) or simply Life, is a cellular automaton devised by the British mathematician John Horton Conway in 1970. It is
Conway's_Game_of_Life
nested stack automaton is a finite automaton that can make use of a stack containing data that can be additional stacks. Like a stack automaton, a nested
Nested_stack_automaton
Cellular automaton with probabilistic rules
A stochastic cellular automaton (SCA), also known as a probabilistic cellular automaton (PCA), is a type of computational model. It consists of a grid
Stochastic_cellular_automaton
Abstract model of quantum computation
A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced
Quantum_cellular_automaton
theory, a co-Büchi automaton is a variant of Büchi automaton. The only difference is the accepting condition: a Co-Büchi automaton accepts an infinite
Co-Büchi_automaton
proven by supplying an algorithm to construct a deterministic Muller automaton for any ω-regular language and vice versa. This theorem has many important
McNaughton's_theorem
Cellular automaton used to model universal construction
Neumann's universal constructor. Nobili cellular automaton is a variation of von Neumann's cellular automaton, augmented with the ability for confluent cells
Von Neumann cellular automaton
Von_Neumann_cellular_automaton
Type of cellular automaton
automata (LGCA), or lattice gas cellular automata, are a type of cellular automaton used to simulate fluid flows, pioneered by Hardy–Pomeau–de Pazzis and
Lattice_gas_automaton
Quantum analog of probabilistic automata
)} indicating the probability of the automaton being in an accept state; that is, indicating whether the automaton accepted or rejected the string. The
Quantum_finite_automaton
cyclic cellular automaton is a kind of cellular automaton rule developed by David Griffeath and studied by several other cellular automaton researchers.
Cyclic_cellular_automaton
Animation World Network. December 27, 2018. Retrieved January 13, 2024. "'Automaton' Pixar's Next Co-Op Short Film Premiering at SIGGRAPH 2020". Pixar Post
List_of_Pixar_shorts
Extension of nondeterministic tree automaton
alternating tree automaton (ATA) is a generalisation of a nondeterministic tree automaton in the same way that an alternating finite automaton is a generalisation
Alternating_tree_automata
Finite-state machine where edges carry weights
In theoretical computer science and formal language theory, a weighted automaton or weighted finite-state machine is a generalization of a finite-state
Weighted_automaton
Early prototype of speech synthesis machine
Multichannel Speaking Automaton (MUSA) was an early prototype of Speech Synthesis machine started in 1975. It consisted of a stand-alone computer hardware
Multichannel Speaking Automaton
Multichannel_Speaking_Automaton
Weak Büchi automaton is a formalism which represents a set of infinite words. A Weak Büchi automaton is a modification of Büchi automaton such that for
Weak_Büchi_automaton
Applied engineering involving liquids
invented water-powered programmable automata/robots. He described four automaton musicians, including drummers operated by a programmable drum machine
Hydraulics
The Ulam–Warburton cellular automaton (UWCA) is a 2-dimensional fractal pattern that grows on a regular grid of cells consisting of squares. Starting
Ulam–Warburton_automaton
String-searching algorithm
virus database), the construction of the automaton can be performed once off-line and the compiled automaton stored for later use. In this case, its run
Aho–Corasick_algorithm
Type of pattern that grows quadratically
In cellular automata such as Conway's Game of Life, a breeder is a pattern that exhibits quadratic growth, by generating multiple copies of a secondary
Breeder_(cellular_automaton)
The intersection non-emptiness problem, also known as finite automaton intersection problem or the non-emptiness of intersection problem, is a PSPACE-complete
Intersection non-emptiness problem
Intersection_non-emptiness_problem
Algorithm to transform a regular expression into a finite automaton
transforming a regular expression into an equivalent nondeterministic finite automaton (NFA). This NFA can be used to match strings against the regular expression
Thompson's_construction
Problem in theoretical computer science
computer science How many states are needed in a deterministic finite automaton that behaves differently on two given strings of length n? More unsolved
Separating_words_problem
Type of pattern that infinitely produces copies of itself
one-dimensional Rule 90 cellular automaton, every pattern is a replicator. The same is true in the life-like cellular automaton rule Replicator (B1357/S1357)
Replicator (cellular automaton)
Replicator_(cellular_automaton)
Data structure representing a finite set of strings
In computer science, a deterministic acyclic finite state automaton (DAFSA), is a data structure that represents a set of strings, and allows for a query
Deterministic acyclic finite state automaton
Deterministic_acyclic_finite_state_automaton
classification task, is the problem of finding one-dimensional cellular automaton rules that accurately perform majority voting. Using local transition
Majority_problem
Concept in theoretical computer science
complementation is a computational problem that applies to automata. An automaton is an abstract machine that verifies a property on its inputs, and either
Complementation_of_automata
Field of computer science
science, a signal automaton is a finite automaton extended with a finite set of real-valued clocks. During a run of a signal automaton, clock values increase
Signal_automaton
Mathematical system
A network automaton (plural network automata) is a mathematical system consisting of a network of nodes that evolves over time according to predetermined
Network_automaton
2D cellular automaton similar to Conway's Game of Life
Seeds is a cellular automaton in the same family as the Game of Life, initially investigated by Brian Silverman and named by Mirek Wójtowicz. It consists
Seeds_(cellular_automaton)
mathematics, a surjunctive group is a group such that every injective cellular automaton with the group elements as its cells is also surjective. Surjunctive groups
Surjunctive_group
Continuous generalization of cellular automata
∈ Z {\displaystyle P\in \mathbb {Z} } . This is the state set of the automaton and characterizes the possible states that may be found at each site.
Lenia
Short story by Steven Millhauser
"The New Automaton Theater" is a short story by Steven Millhauser originally appearing in the magazine Canto (1981) and first collected in The Knife Thrower
The_New_Automaton_Theater
2D cellular automaton similar to Conway's Game of Life
cellular automaton similar to Conway's Game of Life. It was devised in 1994 by Nathan Thompson. It is a two-dimensional, two-state cellular automaton in the
Highlife_(cellular_automaton)
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON
AUTOMATON