Infinite Synchronizing Words for Probabilistic Automata

DOI10.1007/978-3-642-22993-0_27MaRDI QIDQ3088047zbMATH OpenOpenAlexFDO

Authors Laurent Doyen, Thierry Massart, Mahsa Shirmohammadi

Publication date 17 August 2011

Published in Mathematical Foundations of Computer Science 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-22993-0_27

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Recommendations

• Probabilistic automata over infinite words: expressiveness, efficiency, and decidability
• Probabilistic automata on infinite words: decidability and undecidability results
• Decidable problems for probabilistic automata on infinite words
• Synchronizing automata over nested words
• Synchronizing automata over nested words
• scientific article; zbMATH DE number 1822394
• Probabilistic automata for computing with words
• Synchronizing automata with finitely many minimal synchronizing words
• Codeterministic automata on infinite words
• Probabilistic automata on finite words: decidable and undecidable problems

Cited in

(6)

• scientific article; zbMATH DE number 7089067 (Why is no real title available?)
• The complexity of synchronizing Markov decision processes
• Controlling a population
• Synchronizing weighted automata
• Synchronizing words under \textsf{LTL} constraints
• Synchronization of Parikh automata

This page was built for publication: Infinite Synchronizing Words for Probabilistic Automata

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3088047)