A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata |
scientific article; zbMATH DE number 38443
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata |
scientific article; zbMATH DE number 38443 |
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
