Language equivalence for probabilistic automata
In this paper, we propose a new randomised algorithm for deciding language equivalence for probabilistic automata. This algorithm is based on polynomial identity testing and thus returns an answer with an error probability that can be made arbitrarily small. We implemented our algorithm, as well as...
| Auteurs principaux: | , , , , |
|---|---|
| Format: | Journal article |
| Langue: | English |
| Publié: |
2011
|