Hopcroft's algorithm

Today it means: An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour. Full definition →