On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths

DOI10.1007/978-3-642-14455-4_13zbMath1250.05046OpenAlexW2110796788MaRDI QIDQ3584887

Flavio D'Alessandro, Arturo Carpi

Publication date: 31 August 2010

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

Full work available at URL: https://doi.org/10.1007/978-3-642-14455-4_13

zbMATH Keywords

road coloring problemrational seriesČerný conjecturesynchronizing automatonlocally strongly transitive automata

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Coloring of graphs and hypergraphs (05C15) Directed graphs (digraphs), tournaments (05C20)

Related Items (3)

Primitive digraphs with large exponents and slowly synchronizing automata ⋮ On incomplete and synchronizing finite sets ⋮ Černý's conjecture and the road colouring problem

This page was built for publication: On the Hybrid Černý-Road Coloring Problem and Hamiltonian Paths