  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.

Formal Languages and Automata Theory;Discrete Mathematics