OPTIMAL HYPER-MINIMIZATION

DOI10.1142/S0129054111009094zbMath1234.68228MaRDI QIDQ3224954

Daniel Quernheim, Andreas Maletti

Publication date: 13 March 2012

Published in: International Journal of Foundations of Computer Science (Search for Journal in Brave)

zbMATH Keywords

error analysisminimizationdeterministic finite automaton

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (3)

UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS ⋮ Hyper-optimization for deterministic tree automata

Cites Work

• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata

This page was built for publication: OPTIMAL HYPER-MINIMIZATION