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...

Full description

Bibliographic Details
Main Authors: Kiefer, S, Murawski, A, Ouaknine, J, Wachter, B, Worrell, J
Format: Journal article
Language:English
Published: 2011