The Cerny conjecture for one-cluster automata with prime length cycle
Formal Languages and Automata Theory
2010-05-12 v1 Combinatorics
Abstract
We prove the Cerny conjecture for one-cluster automata with prime length cycle. Consequences are given for the hybrid Road-coloring-Cerny conjecture for digraphs with a proper cycle of prime length.
Keywords
Cite
@article{arxiv.1005.1835,
title = {The Cerny conjecture for one-cluster automata with prime length cycle},
author = {Benjamin Steinberg},
journal= {arXiv preprint arXiv:1005.1835},
year = {2010}
}