Decidable and Expressive Classes of Probabilistic Automata

DOI10.1007/978-3-662-46678-0_13zbMath1459.68098OpenAlexW848087444MaRDI QIDQ2949440

No author found.

Publication date: 1 October 2015

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-662-46678-0_13

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Related Items (5)

When are emptiness and containment decidable for probabilistic automata? ⋮ Unnamed Item ⋮ Ambiguity, weakness, and regularity in probabilistic Büchi automata ⋮ Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata ⋮ Decidable and expressive classes of probabilistic automata

This page was built for publication: Decidable and Expressive Classes of Probabilistic Automata