HYPER-MINIMIZATION IN O(n2)

DOI10.1142/S012905410900684XzbMath1180.68166MaRDI QIDQ3395144

Andrew Badr

Publication date: 21 August 2009

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

zbMATH Keywords

DFAminimizationhyper-minimizationDFCA

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items (8)

OPTIMAL HYPER-MINIMIZATION ⋮ An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton ⋮ HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA ⋮ UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION ⋮ Better Hyper-minimization ⋮ FROM EQUIVALENCE TO ALMOST-EQUIVALENCE, AND BEYOND: MINIMIZING AUTOMATA WITH ERRORS ⋮ Hyper-optimization for deterministic tree automata ⋮ More on Minimizing Finite Automata with Errors — Nondeterministic Machines

Cites Work

• Incremental construction of minimal deterministic finite cover automata
• Hyper-minimizing minimized deterministic finite state automata
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Unnamed Item
• Unnamed Item

This page was built for publication: HYPER-MINIMIZATION IN O(n²)