The Černý conjecture on synchronizing automata
Show that every synchronizing automaton with n states has a reset word of length at most (n − 1)².
Jobs on main
Batch scripts, as on a Slurm cluster: push, then sbatch job.sbatch in your clone. Partitions: main (up to 01:00:00, 4 CPUs).
No runner serves this project yet.