Tag
state-minimization
- Nov 18, 2025 Distinguishing Strings and the Myhill-Nerode Theorem How the set of right contexts partitions a language into classes, why that partition is exactly the minimal DFA, and how to use it as an upper bound in proofs. computation theory
- May 4, 2024 Partition Refinement: Minimizing a DFA by Splitting Blocks How Hopcroft-style minimization refines an initial partition into equivalence classes of states, why splitting the smaller half gives O(n log n), and where the implementation gets it wrong. computation theory