Notes on hyper-minimization

MaRDI QIDQ5740410zbMATH OpenFDO

Authors Andreas Maletti

Publication date 26 July 2016

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Recommendations

• Better hyper-minimization. Not as fast, but fewer errors
• Hyper-minimisation Made Efficient
• An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hyper-optimization for deterministic tree automata
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

Cited in

(5)

• \(\tau_{RR}\) minimization in presence of hypermultiplets
• Building efficient and compact data structures for simplicial complexes
• OPTIMAL HYPER-MINIMIZATION
• HYPER-MINIMIZATION IN O(n²)
• The big-O problem

This page was built for publication: Notes on hyper-minimization

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5740410)