An n log n Algorithm for Minimizing States in a Finite Automaton by John Hopcroft
= An n log n Algorithm for Minimizing States in a Finite Automaton by John Hopcroft
{c}
{tag=Work by John E. Hopcroft}
{title2=1971}
Primary technical report STAN-CS-71-190, January1971: https://www.cs.cmu.edu/~cdm/resources/Hopcroft1971.pdf
Locators: Introduction, Formal description of the algorithm, Correctness of algorithm and Analysis of the running time. The constant in O(n log n) depends linearly on alphabet size.