Ambiguity, weakness, and regularity in probabilistic Büchi automata
From MaRDI portal
Publication:2200844
DOI10.1007/978-3-030-45231-5_27OpenAlexW3101162636WikidataQ128215417 ScholiaQ128215417MaRDI QIDQ2200844FDOQ2200844
Authors: Christof Löding, Anton Pirogov 
Publication date: 23 September 2020
Full work available at URL: https://arxiv.org/abs/2004.13692
Recommendations
Cites Work
- Probabilistic automata
- Title not available (Why is that?)
- Probabilistic automata on finite words: decidable and undecidable problems
- Probabilistic ω-automata
- On Decision Problems for Probabilistic Büchi Automata
- CONCUR 2004 - Concurrency Theory
- Finite-state \(\omega\)-languages
- Title not available (Why is that?)
- Decision problems forω-automata
- Title not available (Why is that?)
- On the degree of ambiguity of finite automata
- An effective decision procedure for linear arithmetic over the integers and reals
- Title not available (Why is that?)
- Power of randomization in automata on infinite strings
- Limit-deterministic Büchi automata for linear temporal logic
- On finitely ambiguous Büchi automata
- Complementation of finitely ambiguous Büchi automata
- Probabilistic automata of bounded ambiguity
- Decidable and expressive classes of probabilistic automata
- Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
- Probabilistic Büchi automata with non-extremal acceptance thresholds
- Probabilistic automata over infinite words: expressiveness, efficiency, and decidability
This page was built for publication: Ambiguity, weakness, and regularity in probabilistic Büchi automata
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2200844)
