加入
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
PR
PR 把工作从一条路线带到另一条；合并它就是采纳。
新建 PR
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
PR 把工作从一条路线带到另一条；合并它就是采纳。