UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION

DOI10.1142/S0129054112400485zbMath1283.68198OpenAlexW2155192172MaRDI QIDQ4923276

Daniel Quernheim, Andreas Maletti

Publication date: 6 June 2013

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

Full work available at URL: https://doi.org/10.1142/s0129054112400485

zbMATH Keywords

minimizationclosure propertiessemifielddeterministic finite automatonweighted automatonhyper-minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Related Items

Hyper-optimization for deterministic tree automata

Cites Work

• Unnamed Item
• Introducing VAUCANSON
• State of the art in computational morphology. Workshop on systems and frameworks for computational morphology, SFCM 2009, Zurich, Switzerland, September 4, 2009. Proceedings
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hierarchical clustering schemes
• The structure and construction of taxonomic hierarchies
• AN EFFICIENT ALGORITHM FOR CONSTRUCTING MINIMAL COVER AUTOMATA FOR FINITE LANGUAGES
• OPTIMAL HYPER-MINIMIZATION
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata
• Dynamic Perfect Hashing: Upper and Lower Bounds
• Jewels of Stringology
• A Finite-state Approach to Events in Natural Language Semantics
• Similarity relations and cover automata
• Depth-First Search and Linear Graph Algorithms
• A TIME AND SPACE EFFICIENT ALGORITHM FOR MINIMIZING COVER AUTOMATA FOR FINITE LANGUAGES
• Minimal cover-automata for finite languages