Hyper-minimization for deterministic tree automata

DOI10.1142/S0129054113400200MaRDI QIDQ5401558zbMATH OpenFDO

Authors Artur Jeż, Andreas Maletti

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

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

Recommendations

• Hyper-minimization for deterministic tree automata
• Hyper-optimization for deterministic tree automata
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Hyper-optimization for deterministic tree automata
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton

Cites work

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

Cited in

(12)

• Hyper-minimization for deterministic tree automata
• Hyper-minimisation of deterministic weighted finite automata over semifields
• scientific article; zbMATH DE number 7577580 (Why is no real title available?)
• Hyper-optimization for deterministic tree automata
• Hyper-optimization for deterministic tree automata
• From tree automata to string automata minimization
• scientific article; zbMATH DE number 7361973 (Why is no real title available?)
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Minimizing GFG Transition-Based Automata
• Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
• An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton
• A congruence-based perspective on finite tree automata

This page was built for publication: Hyper-minimization for deterministic tree automata

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