On the Complexity of the Equivalence Problem for Probabilistic Automata
Work
Year: 2012
Type: book-chapter
Institutions University of Oxford, University of Leicester
Cites: 39
Cited by: 9
Related to: 10
FWCI: 2.404
Citation percentile (by year/subfield): 68.45
Subfield: Computational Theory and Mathematics
Field: Computer Science
Domain: Physical Sciences
Open Access status: bronze