The Hybrid Černý-Road coloring problem is investigated for graphs with Hamiltonian paths. We prove that if an aperiodic, strongly connected digraph of costant outdegree with
vertices has an Hamiltonian path, then it admits a synchronizing coloring with a reset word of length 2(
− 1) + 1. The proof is based upon some new results concerning locally strongly transitive automata.