Paper Info
Title
The Černý conjecture for one-cluster automata with prime length cycle
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.
Year
DOI
Venue
2011
10.1016/j.tcs.2011.06.012
Theoretical Computer Science
Keywords
DocType
Volume
One-cluster automata,Synchronization,Černý conjecture,Reset word
Journal
412
Issue
ISSN
Citations 
39
0304-3975
1
PageRank 
References 
Authors
0.37
0
1
Name
Order
Citations
PageRank
Benjamin Steinberg110217.57