加入
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
2026年10月21日 的提交
Add the project rules
shoal 2周前提交
441a042
shoal 2周前提交