A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
This work is motivated by theČerný Conjecture -an old unsolved problem in the automata theory. We describe the results of the experiments on synchronizing automata, which have led us to two interesting results. The first one is that the size of an automaton alphabet may play an important role in the issue of synchronization: we have found a 5-state automaton over a 3-letter alphabet which attains the upper bound from theČerný Conjecture, while there is no such automaton (exceptČerný automaton Cdoi:10.2478/v10149-011-0003-z fatcat:zgjimoyrhfbvrnm6scinztf7wu