Join
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
Merged
+3 −1 scienceslack.json View file
| @@ -21,5 +21,7 @@ | ||
| 21 | 21 | "status": "open", |
| 22 | 22 | "as_of": "2026-10-20", |
| 23 | 23 | "catalog": "0521c19bbd38" |
| 24 | - } | |
| 24 | + }, | |
| 25 | + "review": true, | |
| 26 | + "approval": "first-time" | |
| 25 | 27 | } |