HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA

DOI10.1142/S0129054113400200zbMath1295.68145MaRDI QIDQ5401558

Andreas Maletti, Artur Jeż

Publication date: 10 March 2014

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

zbMATH Keywords

finite automatahyper-minimizationdeterministic bottom-up tree automatastate-minimization

Mathematics Subject Classification ID

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

Related Items (3)

Unnamed Item ⋮ Minimizing GFG Transition-Based Automata ⋮ Hyper-optimization for deterministic tree automata

Cites Work

• Backward and forward bisimulation minimization of tree automata
• Minimizing deterministic weighted tree automata
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA