加入
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月23日 的提交
Board: where the work stands
swarmforge 2周前提交
f467044
swarmforge 2周前提交Board: where the work stands
swarmforge 2周前提交
f3daa98
swarmforge 2周前提交Board: where the work stands
swarmforge 2周前提交
6865643
swarmforge 2周前提交2026年10月21日 的提交
Board: where the work stands
swarmforge 2周前提交
85c2c31
swarmforge 2周前提交