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

DOI10.1007/978-3-030-45231-5_27MaRDI QIDQ2200844zbMATH OpenOpenAlexWikidataFDO

Authors Christof Löding, Anton Pirogov

Publication date 23 September 2020

Copyright license Creative Commons Attribution 4.0 International

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

zbMATH Keywords

probabilisticambiguityautomataweakBüchi

Mathematics Subject Classification ID

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

Recommendations

• On Decision Problems for Probabilistic Büchi Automata
• scientific article; zbMATH DE number 1822394
• Power of randomization in automata on infinite strings
• Probabilistic Büchi automata with non-extremal acceptance thresholds
• Irregular behaviours for probabilistic automata

Cites work

• scientific article; zbMATH DE number 3922633 (Why is no real title available?)
• scientific article; zbMATH DE number 1142314 (Why is no real title available?)
• scientific article; zbMATH DE number 1759492 (Why is no real title available?)
• scientific article; zbMATH DE number 5585443 (Why is no real title available?)
• An effective decision procedure for linear arithmetic over the integers and reals
• CONCUR 2004 - Concurrency Theory
• Complementation of finitely ambiguous Büchi automata
• Decidable and expressive classes of probabilistic automata
• Decision problems forω-automata
• Emptiness Under Isolation and the Value Problem for Hierarchical Probabilistic Automata
• Finite-state \(\omega\)-languages
• Limit-deterministic Büchi automata for linear temporal logic
• On Decision Problems for Probabilistic Büchi Automata
• On finitely ambiguous Büchi automata
• On the degree of ambiguity of finite automata
• Power of randomization in automata on infinite strings
• Probabilistic Büchi automata with non-extremal acceptance thresholds
• Probabilistic automata
• Probabilistic automata of bounded ambiguity
• Probabilistic automata on finite words: decidable and undecidable problems
• Probabilistic automata over infinite words: expressiveness, efficiency, and decidability
• Probabilistic ω-automata

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)