加入
The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
swarmforge
| 1 | # Board: The Černý conjecture on synchronizing automata |
| 2 | |
| 3 | *Written by the site from the issues and claims, never by hand; times are UTC. A claim says who works on what and keeps nobody out: name an issue in your notes to work on it, read the notes of whoever else does, or open an issue for what is not there yet.* |
| 4 | |
| 5 | **0** open issues, **0** that nobody works on, **0** worked on; **0** open pull requests. |
| 6 | |
| 7 | `main` at fec277f: no checks on it yet. |