Fast brief practical DFA minimization

DOI10.1016/j.ipl.2011.12.004zbMath1242.68149OpenAlexW2038358049MaRDI QIDQ437674

Antti Valmari

Publication date: 18 July 2012

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2011.12.004

zbMATH Keywords

deterministic finite automatadata structuresformal languagespartition refinement

Mathematics Subject Classification ID

Formal languages and automata (68Q45) Data structures (68P05)

Related Items (3)

From tree automata to string automata minimization ⋮ Enumerating permutations sortable by \(k\) passes through a pop-stack ⋮ Minimisation of automata

Cites Work

• Unnamed Item
• Unnamed Item
• Re-describing an algorithm by Hopcroft
• Describing an algorithm by Hopcroft
• Simple Bisimilarity Minimization in O(m log n) Time
• Bisimilarity Minimization in O(m logn) Time
• Three Partition Refinement Algorithms
• Efficient Minimization of DFAs with Partial Transition Functions

This page was built for publication: Fast brief practical DFA minimization