A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650)
From MaRDI portal
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
