Better hyper-minimization. Not as fast, but fewer errors

DOI10.1007/978-3-642-18098-9_22MaRDI QIDQ3073639zbMATH OpenOpenAlexFDO

Authors Andreas Maletti

Publication date 11 February 2011

Published in Implementation and Application of Automata (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-18098-9_22

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Formal languages and automata (68Q45)

Recommendations

• OPTIMAL HYPER-MINIMIZATION
• Hyper-optimization for deterministic tree automata
• Hyper-minimisation Made Efficient
• An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
• On minimising automata with errors

Cites work

• An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
• scientific article; zbMATH DE number 1517989 (Why is no real title available?)
• scientific article; zbMATH DE number 3254905 (Why is no real title available?)
• Hyper-minimisation Made Efficient
• Hyper-Minimization in O(n 2)
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata
• Minimal NFA Problems are Hard
• On the Bounds for State-Set Size in the Proofs of Equivalence Between Deterministic, Nondeterministic, and Two-Way Finite Automata

Cited in

(9)

• An n n algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hyper-optimization for deterministic tree automata
• Hyper-minimization for deterministic tree automata
• On minimising automata with errors
• Hyper-minimisation Made Efficient
• Hyper-minimizing minimized deterministic finite state automata
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
• Unweighted and weighted hyper-minimization
• Notes on hyper-minimization

This page was built for publication: Better hyper-minimization. Not as fast, but fewer errors

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