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

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

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

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

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

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

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

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

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

computability theory and other disciplines Von Neumann cellular automata, the original expression of cellular automata Automata theory, the study of abstract...

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

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

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

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

mathematical theories. Almgren–Pitts min-max theory Approximation theory Arakelov theory Asymptotic theory Automata theory Bass–Serre theory Bifurcation theory Braid...

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

cited Hopcroft, John E.; Ullman, Jeffrey D. (1979). Introduction to Automata Theory, Languages, and Computation. Reading, Massachusetts: Addison-Wesley...

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

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

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

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

In physics, string theory is a theoretical framework in which the point-like particles of particle physics are replaced by one-dimensional objects called...

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

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

(PDA) is a type of automaton that employs a stack. Pushdown automata are used in theories about what can be computed by machines. They are more capable...

Probability theory or probability calculus is the branch of mathematics concerned with probability. Although there are several different probability interpretations...

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

biological structures (most genomes include palindromic gene sequences). In automata theory, the set of all palindromes over an alphabet is a context-free language...

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