Hopcroft's algorithm

== English == === Etymology === Introduced by Hopcroft in 1971. === Proper noun === Hopcroft's algorithm (computing theory) An algorithm for merging the non-distinguishable states of a deterministic finite-state automaton, based on partitioning the states into groups by their behaviour.