A new lower bound for reset threshold of synchronizing automata with sink state [article]

Dmitry Ananichev
2017 arXiv   pre-print
We present a new series of examples of binary slowly synchronizing automata with sink state. The reset threshold of the n-state automaton in this series is n^2/4+2n-9. This improves on the previously known lower bound for the maximum reset threshold of binary synchronizing n-state automata with sink state.
arXiv:1701.07954v1 fatcat:re6tkjx32vanveldy22yj4nst4