Černý conjecture

If a deterministic finite automaton with n states has a synchronizing word, must it have one of length at most (n - 1)^2?

Open the “Other problems” section on Wikipedia →

Source: List of unsolved problems in computer science (CC BY-SA 4.0)