About: Probabilistic automaton

Facets (new session)
Description
Metadata
Settings
- Rule:
- Inverse Functional Properties:
- "Same As":

About: Probabilistic automaton Goto Sponge NotDistinct Permalink

An Entity of Type : owl:Thing, within Data Space : el.dbpedia.org associated with source document(s)

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.

Attributes	Values
rdfs:label	Probabilistic automaton (en)
rdfs:comment	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. (en)
sameAs	Probabilistic automaton Probabilistic automaton
dbp:wikiPageUsesTemplate	dbt:Cite_book dbt:Reflist dbt:Technical
Subject	Finite automata Probabilistic models
gold:hypernym	Generalization
prov:wasDerivedFrom	http://en.wikipedia.org/wiki/Probabilistic_automaton?oldid=1052712103&ns=0
Wikipage page ID	11519719 (xsd:integer)
page length (characters) of wiki page	10478 (xsd:nonNegativeInteger)
Wikipage revision ID	1052712103 (xsd:integer)
has abstract	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. 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. (en)
foaf:isPrimaryTopicOf	http://en.wikipedia.org/wiki/Probabilistic_automaton
is Wikipage redirect of	Probabilistic finite automaton Stochastic language Stochastic finite state machine P-adic language Probabilistic automata Probabilistic finite automata Probalistic automaton
is Link from a Wikipage to another Wikipage of	Nondeterministic finite automaton Constraint automaton Michael O. Rabin Index of philosophy articles (I–Q) Ewan Birney Markov decision process

Faceted Search & Find service v1.17_git151 as of Feb 20 2025

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Nov 11 2024, on Linux (x86_64-ubuntu_focal-linux-gnu), Single-Server Edition (72 GB total memory, 1 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2025 OpenLink Software