Abstract   We prove the Cerný conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid road coloring–Cerný conjecture for strongly connected aperiodic digraphs with a proper cycle of prime length.
['Benjamin Steinberg']
The Cerny conjecture for one-cluster automata with prime length cycle