A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1137/0221017 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2027671360 / rank | |||
Normal rank | |||
Latest revision as of 22:36, 19 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata |
scientific article |
Statements
A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (English)
0 references
28 June 1992
0 references
nondeterministic finite automata
0 references
unambiguous finite automata
0 references
path equivalence
0 references
approximate equivalence
0 references
