This article may be too technical for most readers to understand. Please help improve it to make it understandable to non-experts, without removing the technical details.(January 2021) (Learn how and when to remove this message)
In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix.[1][2] Thus, the probabilistic automaton also generalizes the concepts of a Markov chain and of a subshift of finite type. The languages recognized by probabilistic automata are called stochastic languages; these include the regular languages as a subset. The number of stochastic languages is uncountable.
The concept was introduced by Michael O. Rabin in 1963;[2] a certain special case is sometimes known as the Rabin automaton (not to be confused with the subclass of ω-automata also referred to as Rabin automata). In recent years, a variant has been formulated in terms of quantum probabilities, the quantum finite automaton.
^Paz, Azaria (2014). Introduction to probabilistic automata. ISBN 9781483244655. OCLC 1027002902.
^ abMichael O. Rabin (1963). "Probabilistic Automata". Information and Control. 6 (3): 230–245. doi:10.1016/s0019-9958(63)90290-0.
and 23 Related for: Probabilistic automaton information
mathematics and computer science, the probabilisticautomaton (PA) is a generalization of the nondeterministic finite automaton; it includes the probability of...
A cellular automaton (pl. cellular automata, abbrev. CA) is a discrete model of computation studied in automata theory. Cellular automata are also called...
automata theory, a finite-state machine is called a deterministic finite automaton (DFA), if each of its transitions is uniquely determined by its source...
the infinite sequence of visited states during the run. Probabilistic acceptance: An automaton need not strictly accept or reject an input. It may accept...
theory's point of view. There is a version of the majority cellular automaton with probabilistic updating rules. See the Toom's rule. PCA may be used to simulate...
matrices, and a probability vector for the state; this gives a probabilistic finite automaton. The entries in the state vector must be real numbers, positive...
transitions and influence their firing. Model checking Finite automata Probabilisticautomaton Colored Petri net "Linear Temporal Logic of Constraint Automata"...
difference equation Models of DNA evolution Muirhead's inequality Probabilisticautomaton Transition rate matrix, used to generalize the stochastic matrix...
computational descriptions. As Putnam put it, “everything is a ProbabilisticAutomaton under some Description”. Even rocks, walls, and buckets of water—contrary...
refer to this as a quantum dot cellular automaton. Quantum finite automata – Quantum analog of probabilistic automataPages displaying short descriptions...
mathematician who also worked in physics and biological sciences: Stan, probabilistic programming language Borsuk–Ulam theorem Erdős–Ulam problem Fermi–Pasta–Ulam–Tsingou...
Performic acid See also PFAS, Per- and polyfluoroalkyl substances Probabilistic finite automaton .pfa, Printer Font ASCII, a file extension for PostScript Printer...
making it extremely practical to perform computing with them. A cellular automaton (CA) is a discrete dynamical system consisting of a uniform (finite or...
can perform differently on different runs due to a race condition. A probabilistic algorithm's behaviors depends on a random number generator. An algorithm...
can be described by one of the mathematical formalisms called "finite automaton", "regular grammar", or "regular expression", all of which have the same...
digital computation device, or as the output of a deterministic or probabilistic computer program. The hypothesis that the universe is a digital computer...
(TM) in the same way that the quantum finite automaton (QFA) generalizes the deterministic finite automaton (DFA). In essence, the internal states of a...
re-write rules or productions or alternatively as a finite state machine or automaton of some kind) from a set of observations, thus constructing a model which...
Poisson process Compound Poisson process Population process Probabilistic cellular automaton Queueing theory Queue Random field Gaussian random field Markov...
Global Information