"On the Complexity of the Equivalence Problem for Probabilistic Automata."

Stefan Kiefer et al. (2012)

Details and statistics

DOI: 10.1007/978-3-642-28729-9_31

access: open

type: Conference or Workshop Paper

metadata version: 2025-03-03

manage site settings

To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.