Slowly synchronizing automata and digraphs
arXiv:1005.0129 · doi:10.1007/978-3-642-15155-2_7
Abstract
We present several infinite series of synchronizing automata for which the minimum length of reset words is close to the square of the number of states. These automata are closely related to primitive digraphs with large exponent.
13 pages, 5 figures