Join
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
Comparing changes
Choose two branches to see what changed, then open a pull request to bring the work across.
Pick two different branches
A pull request can go from any branch into any other.