Better Hyper-minimization

DOI10.1007/978-3-642-18098-9_22zbMath1297.68154OpenAlexW3123737839MaRDI QIDQ3073639

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)

Cites Work

• Unnamed Item
• Unnamed Item
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hyper-minimisation Made Efficient
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata
• Hyper-Minimization in O(n 2)
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
• 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