External Links

Cite Key

Statistics

  • References: 0
  • Cited by: 0
  • Reviews: 0
  • Bibliographies: 0

PDF

Researchr

Researchr is a web site for finding, collecting, sharing, and reviewing scientific publications, for researchers by researchers.

Sign up for an account to create a profile with publication list, tag and review your related work, and share bibliographies with your co-authors.

On the Complexity of the Equivalence Problem for Probabilistic Automata

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]

Authors

Stefan Kiefer

This author has not been identified. Look up 'Stefan Kiefer' in Google

Andrzej S. Murawski

This author has not been identified. Look up 'Andrzej S. Murawski' in Google

Joël Ouaknine

This author has not been identified. Look up 'Joël Ouaknine' in Google

Björn Wachter

This author has not been identified. Look up 'Björn Wachter' in Google

James Worrell

This author has not been identified. Look up 'James Worrell' in Google
runs on