Separating words problem

How many states are needed in a deterministic finite automaton that behaves differently on two given strings of length n?

Open the “Other problems” section on Wikipedia →

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