In quantum computing, quantum finite automata (QFA) or quantum state machines are a quantum analog of probabilistic automata or a Markov decision process...

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

deterministic finite automaton (DFA)—also known as deterministic finite acceptor (DFA), deterministic finite-state machine (DFSM), or deterministic finite-state...

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

terms of quantum probabilities, the quantum finite automaton. For a given initial state and input character, a deterministic finite automaton (DFA) has...

of operations automatically. An automaton with a finite number of states is called a finite automaton (FA) or finite-state machine (FSM). The figure on...

channel Quantum finite automaton Quantum logic Quantum memory Quantum network Quantum Zeno effect Reversible computing Unitary transformation (quantum mechanics)...

understanding the quantum Turing machine (QTM) is that it generalizes the classical Turing machine (TM) in the same way that the quantum finite automaton (QFA) generalizes...

A quantum cellular automaton (QCA) is an abstract model of quantum computation, devised in analogy to conventional models of cellular automata introduced...

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

and microstructure modeling. A cellular automaton consists of a regular grid of cells, each in one of a finite number of states, such as on and off (in...

General purpose analog computer Hypercomputation Real computer Quantum finite automaton Blum, Lenore; Shub, Mike; Smale, Steve (1989). "On a Theory of...

cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite or infinite) grid of cells. Each cell can be in only one of a finite number...

Hypercomputation, for other such powerful machines. Real RAM. Quantum finite automaton, for a generalization to arbitrary geometrical spaces. Klaus Weihrauch...

the set of labellings of paths through an automaton: a subshift of finite type then corresponds to an automaton which is deterministic. Such systems correspond...

and theoretical computer science, a semiautomaton is a deterministic finite automaton having inputs but no output. It consists of a set Q of states, a set...

can perform to those of a linear bounded automaton if the tape was proportional to the input size, or finite-state machine if it was strictly fixed-length...

recursion Finite-state automaton Mealy machine Minsky register machine Moore machine State diagram State transition system Deterministic finite automaton Nondeterministic...

Retrieved 2021-09-16. 't Hooft, Gerard (2016). The Cellular Automaton Interpretation of Quantum Mechanics. Fundamental Theories of Physics. Vol. 185. Springer...

a huge cellular automaton which continuously updates its rules. Recently it has been suggested that the whole universe is a quantum computer that computes...

infinite space–time. However, in local quantum field theory we would restrict everything to lie within a finite causally complete region, for example inside...

on a Quantum Computer". arXiv:quant-ph/0008033. Ruiz-Perez, Lidia; Juan Carlos, Garcia-Escartin (2 May 2017). "Quantum arithmetic with the quantum Fourier...

deterministic finite automata string search deterministic finite automaton (DFA) deterministic finite state machine deterministic finite tree automaton deterministic...

such as a finite-state automaton. It is undecidable for context-sensitive grammars. The mortal matrix problem. Determining whether a finite set of upper...

computer Finite-state machine with datapath Hierarchical Deterministic finite automaton Queue automaton Cellular automaton Quantum cellular automaton Turing...

Aanderaa–Karp–Rosenberg conjecture true? Černý conjecture: If a deterministic finite automaton with n {\displaystyle n} states has a synchronizing word, must it have...

operator Markov random field Master equation Quantum Markov chain Semi-Markov process Stochastic cellular automaton Telescoping Markov chain Variable-order...

quantum states in a local deterministic theory". arXiv:0908.3408 [quant-ph]. Gerard 't Hooft, 2016, The Cellular Automaton Interpretation of Quantum Mechanics...

conservation laws. A block cellular automaton consists of the following components: A regular lattice of cells A finite set of the states that each cell...

recreational mathematics, most notably the invention of the cellular automaton called the Game of Life. Born and raised in Liverpool, Conway spent the...