  Berlinkov has suggested an algorithm that, given a deterministic finite
automaton $\mathcal{A}$, verifies whether or not $\mathcal{A}$ is synchronizing
in linear (of the number of states and letters) expected time. We present a
modification of Berlinkov's algorithm which we have implemented and tested. Our
experiments show that the implementation outperforms the standard quadratic
algorithm even for automata of modest size and allow us to give a statistically
accurate approximation of the ratio of non-synchronizing automata amongst all
automata with a given number of states.
