LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA
For each odd n >= 5 we present a synchronizing Eulerian automaton with n states for which the minimum length of reset words is equal to n(2)-2n+4 /2. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying graph.
synchronizing automata exponent of digraph cerny conjecture