The Synchronization Problem for Strongly Transitive Automata

DOI10.1007/978-3-540-85780-8_19zbMath1161.68517OpenAlexW2146506707MaRDI QIDQ3533015

Flavio D'Alessandro, Arturo Carpi

Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-85780-8_19

zbMATH Keywords

rational seriessynchronizing automataČerný conjecture

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (7)

ON A CONJECTURE BY CARPI AND D'ALESSANDRO ⋮ The Synchronization Problem for Locally Strongly Transitive Automata ⋮ An algorithm for road coloring ⋮ On incomplete and synchronizing finite sets ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata ⋮ Strongly transitive automata and the Černý conjecture

Cites Work

• Unambiguous automata
• On synchronizing unambiguous automata
• An extremal problem for two families of sets
• Synchronizing finite automata on Eulerian digraphs.
• Almost optimal bound of recurrent word length for regular automata
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: The Synchronization Problem for Strongly Transitive Automata