Matches in DBpedia 2016-04 for { <http://wikidata.dbpedia.org/resource/Q176567> ?p ?o }
Showing triples 1 to 37 of
37
with 100 triples per page.
- Q176567 subject Q7483212.
- Q176567 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.".
- Q176567 wikiPageWikiLink Q1057996.
- Q176567 wikiPageWikiLink Q1128796.
- Q176567 wikiPageWikiLink Q1144925.
- Q176567 wikiPageWikiLink Q1289248.
- Q176567 wikiPageWikiLink Q1500617.
- Q176567 wikiPageWikiLink Q176452.
- Q176567 wikiPageWikiLink Q176583.
- Q176567 wikiPageWikiLink Q176645.
- Q176567 wikiPageWikiLink Q176837.
- Q176567 wikiPageWikiLink Q179899.
- Q176567 wikiPageWikiLink Q184754.
- Q176567 wikiPageWikiLink Q192161.
- Q176567 wikiPageWikiLink Q200726.
- Q176567 wikiPageWikiLink Q205170.
- Q176567 wikiPageWikiLink Q208237.
- Q176567 wikiPageWikiLink Q21198.
- Q176567 wikiPageWikiLink Q2538404.
- Q176567 wikiPageWikiLink Q2716994.
- Q176567 wikiPageWikiLink Q311627.
- Q176567 wikiPageWikiLink Q331350.
- Q176567 wikiPageWikiLink Q3333764.
- Q176567 wikiPageWikiLink Q357965.
- Q176567 wikiPageWikiLink Q36161.
- Q176567 wikiPageWikiLink Q371983.
- Q176567 wikiPageWikiLink Q395.
- Q176567 wikiPageWikiLink Q617295.
- Q176567 wikiPageWikiLink Q7449364.
- Q176567 wikiPageWikiLink Q7483212.
- Q176567 wikiPageWikiLink Q752532.
- Q176567 wikiPageWikiLink Q7631990.
- Q176567 wikiPageWikiLink Q837518.
- Q176567 wikiPageWikiLink Q849775.
- Q176567 wikiPageWikiLink Q879439.
- Q176567 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.".
- Q176567 label "Probabilistic automaton".