On the Complexity of Equivalence and Minimisation for Q-weighted Automata (2013)

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.2168/lmcs-9(1:8)2013

Publication URI: http://dx.doi.org/10.2168/lmcs-9(1:8)2013

Type: Journal Article/Review

Parent Publication: Logical Methods in Computer Science