The Černý conjecture for one-cluster automata with prime length cycle

We prove the Černý conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid road coloring–Černý conjecture for strongly connected aperiodic digraphs with a proper cycle of prime length.