Ambiguity, weakness, and regularity in probabilistic Büchi automata

DOI10.1007/978-3-030-45231-5_27OpenAlexW3101162636MaRDI QIDQ2200844

Anton Pirogov, Christof Löding

Publication date: 23 September 2020

Full work available at URL: https://arxiv.org/abs/2004.13692

zbMATH Keywords

automataambiguityprobabilisticweakBüchi

Mathematics Subject Classification ID

Theory of computing (68Qxx) Theory of software (68Nxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finite-state \(\omega\)-languages
• On the degree of ambiguity of finite automata
• On finitely ambiguous Büchi automata
• Complementation of finitely ambiguous Büchi automata
• 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 on Finite Words: Decidable and Undecidable Problems
• Limit-Deterministic Büchi Automata for Linear Temporal Logic
• Probabilistic Automata of Bounded Ambiguity
• An effective decision procedure for linear arithmetic over the integers and reals
• CONCUR 2004 - Concurrency Theory
• Probabilistic ω-automata
• On Decision Problems for Probabilistic Büchi Automata
• Probabilistic automata
• Decision problems forω-automata
• Power of Randomization in Automata on Infinite Strings