LOWER BOUNDS FOR THE LENGTH OF RESET WORDS IN EULERIAN AUTOMATA
Vladimir V. Gusev · International Journal of Foundations of Computer Science · 2013
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 [Formula: see text]. We also discuss various connections between the reset threshold of a synchronizing automaton and a sequence of reachability properties in its underlying graph.