| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438968 | Theoretical Computer Science | 2011 | 5 Pages |
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.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
