cerny_conjecture (291B)
1 # Cerny_conjecture 2 3 https://en.wikipedia.org/wiki/Synchronizing_word 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 Up: [synchronizing_word] 8 9 See also: [completely_reachable_automata]