📣 Help Shape the Future of UKRI's Gateway to Research (GtR)

We're improving UKRI's Gateway to Research and are seeking your input! Tell us what works, what doesn't, and how we can make GtR more user-friendly, impactful, and effective for the Research and Innovation community. Please send your feedback to gateway@ukri.org by 11 August 2025.

On the Complexity of the Equivalence Problem for Probabilistic Automata

First Author: Kiefer S

Attributed to: Automated Verification of Probabilistic Programs funded by EPSRC

Abstract

No abstract provided

Bibliographic Information

Digital Object Identifier: http://dx.doi.org/10.1007/978-3-642-28729-9_31

Publication URI: http://dx.doi.org/10.1007/978-3-642-28729-9_31

Type: Book Chapter

Book Title: Foundations of Software Science and Computational Structures (2012)

Page Reference: 467-481

ISBN: 978-3-642-28728-2