On the Complexity of the Equivalence Problem for Probabilistic Automata

DOI10.1007/978-3-642-28729-9_31zbMath1352.68114arXiv1112.4644OpenAlexW1719685820MaRDI QIDQ2892790

Andrzej S. Murawski, Stefan Kiefer, Joël Ouaknine, Björn Wachter, James Worrell

Publication date: 22 June 2012

Published in: Foundations of Software Science and Computational Structures (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1112.4644

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (2)

Relations on words ⋮ Undecidable Problems for Probabilistic Network Programming

This page was built for publication: On the Complexity of the Equivalence Problem for Probabilistic Automata