A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2020; you can also visit the original URL.
The file type is
Instead of looking at the lengths of synchronizing words as in Černý's conjecture, we look at the switch count of such words, that is, we only count the switches from one letter to another. Where the synchronizing words of the Černý automata C_n have switch count linear in n, we wonder whether synchronizing automata exist for which every synchronizing word has quadratic switch count. The answer is positive: we prove that switch count has the same complexity as synchronizing word length. We givearXiv:1812.04050v1 fatcat:3n3vcp2xyvhizd2pbzud4tqyga