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

doi:10.1016/j.tcs.2011.06.012

Theoretical Computer Science

Volume 412, Issue 39, 9 September 2011, Pages 5487-5491

https://doi.org/10.1016/j.tcs.2011.06.012 Get rights and content

Under an Elsevier user license

open archive

Abstract

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.

Keywords

One-cluster automata

Synchronization

Černý conjecture

Reset word

Theoretical Computer Science

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

Abstract

Keywords

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