The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
Pull requests
Pull requests bring work from one route into another; merging one adopts it.
No open pull requests
Pull requests bring work from one branch into another.