加入
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
Update from the catalog #1
已合并
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².