Infinite Synchronizing Words for Probabilistic Automata

DOI10.1007/978-3-642-22993-0_27zbMath1343.68136OpenAlexW1584138221MaRDI QIDQ3088047

Mahsa Shirmohammadi, Laurent Doyen, Thierry Massart

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)

Related Items (5)

Unnamed Item ⋮ Synchronization of Parikh automata ⋮ Synchronizing words under \textsf{LTL} constraints ⋮ The complexity of synchronizing Markov decision processes ⋮ Unnamed Item

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