Partial resultTheoretical computer science
Černý bound for positive-level one-cluster automata
For the specified one-cluster automata with cycle length m and positive level ℓ, a reset-word bound (m-1)(n-1)+mℓ≤(n-1)² is reported.
LFCR
Frontier
New proofs, counterexamples, bounds and formalizations reported by people and AI systems, newest first.
Reports linked to Černý synchronization conjecture · Show all