Stefan Kiefer, Andrzej S. Murawski, Joël Ouaknine, Björn Wachter, James Worrell. On the Complexity of the Equivalence Problem for Probabilistic Automata. In Lars Birkedal, editor, Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings. Volume 7213 of Lecture Notes in Computer Science, pages 467-481, Springer, 2012. [doi]
@inproceedings{KieferMOWW12-0,
title = {On the Complexity of the Equivalence Problem for Probabilistic Automata},
author = {Stefan Kiefer and Andrzej S. Murawski and Joël Ouaknine and Björn Wachter and James Worrell},
year = {2012},
doi = {10.1007/978-3-642-28729-9_31},
url = {http://dx.doi.org/10.1007/978-3-642-28729-9_31},
researchr = {https://researchr.org/publication/KieferMOWW12-0},
cites = {0},
citedby = {0},
pages = {467-481},
booktitle = {Foundations of Software Science and Computational Structures - 15th International Conference, FOSSACS 2012, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2012, Tallinn, Estonia, March 24 - April 1, 2012. Proceedings},
editor = {Lars Birkedal},
volume = {7213},
series = {Lecture Notes in Computer Science},
publisher = {Springer},
isbn = {978-3-642-28728-2},
}