Probabilistic automaton
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. 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.
- Abstraction100002137
- Assistant109815790
- CausalAgent100007347
- Communication100033020
- Language106282651
- LivingThing100004258
- Model110324560
- Object100002684
- Organism100004475
- Person100007846
- PhysicalEntity100001930
- Whole100003553
- WikicatFormalLanguages
- WikicatProbabilisticModels
- Worker109632518
- YagoLegalActor
- YagoLegalActorGeo
- Comment
- enIn 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. 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.
- Has abstract
- enIn 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. 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; 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.
- Hypernym
- Generalization
- Is primary topic of
- Probabilistic automaton
- Label
- enProbabilistic automaton
- Link from a Wikipage to another Wikipage
- Alphabet (computer science)
- Category:Finite automata
- Category:Probabilistic models
- Complex projective space
- Computer science
- Coordinate vector
- Currying
- Deterministic finite automaton
- Discrete probability distribution
- Finite state machine
- Formal language
- Input symbol
- Kleene star
- Markov chain
- Mathematics
- Membership function
- Michael O. Rabin
- Monoid
- Nondeterministic finite automaton
- P-adic
- Pergamon Press
- Power set
- Quantum angle
- Quantum finite automaton
- Regular language
- Row and column vectors
- Row vector
- Scalar (mathematics)
- Semiautomaton
- Set (mathematics)
- Simplex
- Stochastic matrix
- Stochastic vector
- String (computer science)
- Subshift of finite type
- Topological automaton
- Topological space
- Uncountable
- Unitary group
- Ω-automaton
- SameAs
- Automa a stati finiti probabilistico
- Automate probabiliste
- Autômato Probabilístico
- iQ8a
- m.02rgmnj
- Probabilistic automaton
- Q176567
- Вероятностный автомат
- אוטומט הסתברותי
- اتوماتای احتمالاتی
- Subject
- Category:Finite automata
- Category:Probabilistic models
- WasDerivedFrom
- Probabilistic automaton?oldid=1052712103&ns=0
- WikiPageLength
- 10478
- Wikipage page ID
- 11519719
- Wikipage revision ID
- 1052712103
- WikiPageUsesTemplate
- Template:Cite book
- Template:Reflist
- Template:Technical