A Polynomial-Time Algorithm for the Equivalence of Probabilistic Automata (Q3990650): Difference between revisions
From MaRDI portal
Added link to MaRDI item. |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 00:39, 5 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
