ON A CONJECTURE BY CARPI AND D'ALESSANDRO
Mikhail V. Berlinkov · International Journal of Foundations of Computer Science · 2011
Recently, Carpi and D'Alessandro have formulated a conjecture whose validity would imply an O(n2) upper bound for the minimum length of reset for synchronizing automata with n states. We refute this conjecture as well as a related conjecture by Rystsov and suggest a weaker version that still suffices to achieve a quadratic upper bound.