Two words are equivalent when no suffix tells them apart. Sort words into classes to build the minimal DFA from words alone, or find infinitely many classes and prove no DFA exists.
This interactive visualization needs JavaScript.