The Synchronization Problem for Locally Strongly Transitive Automata

DOI10.1007/978-3-642-03816-7_19zbMath1250.68150OpenAlexW1584585297MaRDI QIDQ3182926

Flavio D'Alessandro, Arturo Carpi

Publication date: 16 October 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-642-03816-7_19

zbMATH Keywords

road coloring problemrational seriesČerný conjecturesynchronizing automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coloring of graphs and hypergraphs (05C15)

Related Items (3)

On incomplete and synchronizing finite sets ⋮ The Černý conjecture for one-cluster automata with prime length cycle ⋮ Černý's conjecture and the road colouring problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The road coloring problem
• On synchronizing unambiguous automata
• The road-colouring problem
• An extremal problem for two families of sets
• Equivalence of topological Markov shifts
• Synchronizing finite automata on Eulerian digraphs.
• Synchronizing generalized monotonic automata
• Almost optimal bound of recurrent word length for regular automata
• The Synchronization Problem for Strongly Transitive Automata
• Synchronizing Automata and the Černý Conjecture
• A Quadratic Upper Bound on the Size of a Synchronizing Word in One-Cluster Automata

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