32 citations · 32 across the 2 of their papers we have counts for
3 papers
cs.FL2017
A new lower bound for reset threshold of synchronizing automata with sink state
Dmitry Ananichev
We present a new series of examples of binary slowly synchronizing automata with sink state. The reset threshold of the -state automaton in this series is .…
cs.FL2013★ 32 cited
Primitive digraphs with large exponents and slowly synchronizing automata
Dmitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov
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. All these automata are tigh…
cs.FL2010
Slowly synchronizing automata and digraphs
Dmitry S. Ananichev, Vladimir V. Gusev, Mikhail V. Volkov
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…