1 problem

Cameron's conjecture. A random automaton is synchronizable with high probability; equivalently, the probability that it is synchronizable tends to $1$ as $n$ tends to infinity.