Automata theory is the study of abstract machines and automata, as well as the computational problems that can be solved using them. It is a theory in...

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

into three major branches: automata theory and formal languages, computability theory, and computational complexity theory, which are linked by the question:...

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

Introduction to Automata Theory, Languages, and Computation is an influential computer science textbook by John Hopcroft and Jeffrey Ullman on formal...

book Theory of Self-Reproducing Automata, completed in 1966 by Arthur W. Burks after von Neumann's death. It is regarded as foundational for automata theory...

metabolic-replication systems, category theory applications in biology and medicine, automata theory, cellular automata, tessellation models and complete self-reproduction...

quantum computation, automata theory, information theory, cryptography, program semantics and verification, algorithmic game theory, machine learning, computational...

science, the Krohn–Rhodes theory (or algebraic automata theory) is an approach to the study of finite semigroups and automata that seeks to decompose them...

Game Theory. Vol. Games of No Chance 3. Grier, Daniel (2013). "Deciding the Winner of an Arbitrary Finite Poset Game is PSPACE-Complete". Automata, Languages...

For more comprehensive introduction of the formal definition see automata theory. The following example is of a DFA M, with a binary alphabet, which...

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

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

In computer science, in particular in automata theory, a two-way finite automaton is a finite automaton that is allowed to re-read its input. A two-way...

complexity measure. As he remembers: However, [my] initial interest [in automata theory] was increasingly set aside in favor of computational complexity, an...

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

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

City) is an American researcher in formal languages in computing, automata, compiler theory and computer science. She is an Emeritus Professor of Computer...

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

In the theory of computation and automata theory, the powerset construction or subset construction is a standard method for converting a nondeterministic...

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

Gross (1996). Introduction to the CUCH. In E. R. Caianiello (ed.), Automata Theory, p. 35–64. Benjamin C. Pierce. 2002. Types and Programming Languages...

global warming (AGW) theories (due to human activity) Computer Science: Automata theory — Queueing theory Cosmology: Big Bang Theory — Cosmic inflation...

In automata theory, a tree is a particular way of representing a tree structure as sequences of natural numbers. For example, each node of the tree is...

University; he is now retired and lives in Berkeley, California. His work on automata theory earned him the Turing Award in 1976, while his collaborative work with...

time, space, and other resources taken by computations. Automata theory and formal language theory are closely related to computability. Petri nets and process...

and Automata Theory. pp. 125–129. L. J. Stockmeyer; A. R. Meyer (1973). "Word Problems Requiring Exponential Time". Proc. 5th ann. symp. on Theory of computing...

of the Theory of Computational Complexity to the Study of Inductive Inference (Ph.D.). University of California at Berkeley. Automata theory Distributed...

In physics, a gauge theory is a type of field theory in which the Lagrangian, and hence the dynamics of the system itself, does not change under local...

(also called finite automata). This was introduced by Claude Shannon and Warren Weaver in their 1949 book The Mathematical Theory of Communication. Another...