Assertion: probabilistic automaton | /r/DefinedAs | the tuple
Facets:
value: formally
type: MANNER
Source sentences:
text: Formally, a probabilistic automaton PA is defined as the tuple ( Q , Σ , P , v , F ) {\displaystyle (Q,\Sigma ,P,v,F)} .