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

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

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

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

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

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

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

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

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

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

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

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

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

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

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 Muller automaton is a type of an ω-automaton. The acceptance condition separates a Muller automaton from other ω-automata. The Muller...

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 branch of theoretical computer science), DFA minimization is the task of transforming a given deterministic finite automaton (DFA)...

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

computer scientist known for his contributions to the algebraic automata theory and semigroup theory. He is a CNRS research director. Pin earned his undergraduate...

ISBN 9780080916613. John E. Hopcroft and Jeffrey D. Ullman, Introduction to Automata Theory, Languages and Computation, Addison-Wesley Publishing, Reading Massachusetts...

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

Jerusalem. Safra's research areas include complexity theory and automata theory. His work in complexity theory includes the classification of approximation problems—showing...

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

recognizers, formal language theory uses separate formalisms, known as automata theory. One of the interesting results of automata theory is that it is not possible...

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

numbering reset to 1. The main focus of the journal is on automata theory, formal language theory, and combinatorics. The editor-in-chief of the journal...

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