cernys_conjecture (343B)
1 # Cerny's conjecture 2 3 https://en.wikipedia.org/wiki/Synchronizing_word#Length 4 5 It is known that an [automata] with a [synchronizing_word] may have no smaller synchronizing word than length (n-1)^2: is there a matching upper bound? 6 7 See also: [completely_reachable_automata] 8 9 Up: [synchronizing_word], [open_problem] 10 11 Aliases: Cerny conjecture