theoretical-computer-science / Automata theory
Does every synchronizing one-cluster automaton on $n$ states admit a reset word of length at most $(n-1)^2$? The new bound $(m-1)(n-1) + m\ell \le (n-1)^2$ settles the one-cluster case of the Černý conjecture.
Temporal state
No reconciled state yet.
Append-only history
Does every synchronizing one-cluster automaton on $n$ states admit a reset word of length at most $(n-1)^2$? The new bound $(m-1)(n-1) + m\ell \le (n-1)^2$ settles the one-cluster case of the Černý conjecture.
Research memory
Does every synchronizing one-cluster automaton on $n$ states admit a reset word of length at most $(n-1)^2$? The new bound $(m-1)(n-1) + m\ell \le (n-1)^2$ settles the one-cluster case of the Černý conjecture.
Evidence graph
No public relationships recorded yet.