4 citations · 5 across the 3 of their papers we have counts for
1 paper · 1 filter
Marek Szykuła, Vojtěch Vorel
We present an infinite series of n-state Eulerian automata whose reset words have length at least (n2−3)/2. This improves the current lower bound on the length of shortest res…