Matches in DBpedia 2014 for { <http://dbpedia.org/resource/Probabilistic_automaton> ?p ?o. }
Showing items 1 to 31 of
31
with 100 items per page.
- Probabilistic_automaton abstract "In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix or stochastic matrix. Thus, the probabilistic automaton generalizes the concept of a Markov chain or 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. In recent years, a variant has been formulated in terms of quantum probabilities, the quantum finite automaton.".
- Probabilistic_automaton wikiPageID "11519719".
- Probabilistic_automaton wikiPageRevisionID "544820974".
- Probabilistic_automaton hasPhotoCollection Probabilistic_automaton.
- Probabilistic_automaton subject Category:Automata_theory.
- Probabilistic_automaton subject Category:Probabilistic_models.
- Probabilistic_automaton type Assistant109815790.
- Probabilistic_automaton type CausalAgent100007347.
- Probabilistic_automaton type LivingThing100004258.
- Probabilistic_automaton type Model110324560.
- Probabilistic_automaton type Object100002684.
- Probabilistic_automaton type Organism100004475.
- Probabilistic_automaton type Person100007846.
- Probabilistic_automaton type PhysicalEntity100001930.
- Probabilistic_automaton type ProbabilisticModels.
- Probabilistic_automaton type Whole100003553.
- Probabilistic_automaton type Worker109632518.
- Probabilistic_automaton type YagoLegalActor.
- Probabilistic_automaton type YagoLegalActorGeo.
- Probabilistic_automaton comment "In mathematics and computer science, the probabilistic automaton (PA) is a generalization of the non-deterministic finite automaton; it includes the probability of a given transition into the transition function, turning it into a transition matrix or stochastic matrix. Thus, the probabilistic automaton generalizes the concept of a Markov chain or subshift of finite type.".
- Probabilistic_automaton label "Automate probabiliste".
- Probabilistic_automaton label "Autômato Probabilístico".
- Probabilistic_automaton label "Probabilistic automaton".
- Probabilistic_automaton sameAs Automate_probabiliste.
- Probabilistic_automaton sameAs Autômato_Probabilístico.
- Probabilistic_automaton sameAs m.02rgmnj.
- Probabilistic_automaton sameAs Q176567.
- Probabilistic_automaton sameAs Q176567.
- Probabilistic_automaton sameAs Probabilistic_automaton.
- Probabilistic_automaton wasDerivedFrom Probabilistic_automaton?oldid=544820974.
- Probabilistic_automaton isPrimaryTopicOf Probabilistic_automaton.