AWhat changed
Hopcroft supplied an n log n state-minimization algorithm for complete deterministic finite automata with fixed alphabet, using partition refinement and carefully scheduled splitters.
Scientific scope
Hopcroft supplied an n log n state-minimization algorithm for complete deterministic finite automata with fixed alphabet, using partition refinement and carefully scheduled splitters. The partition-refinement algorithm concerns finite deterministic automata and the specified alphabet/transition representation. Its time bound depends on how the alphabet and transitions are counted. It is not minimization of arbitrary nondeterministic machines or an all-purpose state-space reduction theorem. Later implementation variants retain separate credit.
Evidence
Source-linked, scoped account of the original work. The published scope states the scientific assumptions and remaining verification limits. WRS has not independently certified the full proof, experimental result or system benchmark.
Contributors
- John Hopcroft · SCIENCE: Original source-listed scientific author of this scoped work; byline does not determine effort fractions.
- Hopcroft — original Stanford technical report STAN-CS-71-190
- Hopcroft — original 1971 chapter publisher deposit
Provisional WRS assessment, edition 2026-10-16.1. Independent expert calibration is pending. This grade does not certify correctness or assign ownership.
Full scientific record · Browse contribution grades · Request a correction