Hyper-Minimization in O(n 2)

DOI10.1007/978-3-540-70844-5_23zbMath1172.68492OpenAlexW2092282351MaRDI QIDQ3602817

Andrew Badr

Publication date: 12 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-70844-5_23

Mathematics Subject Classification ID

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

Related Items (5)

Hyper-minimisation Made Efficient ⋮ Unnamed Item ⋮ An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton ⋮ Better Hyper-minimization ⋮ An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

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
• Unnamed Item

This page was built for publication: Hyper-Minimization in O(n 2)