Hyper-optimization for deterministic tree automata

DOI10.1016/j.tcs.2015.01.020zbMath1319.68138OpenAlexW2044036493MaRDI QIDQ2344747

Andreas Maletti

Publication date: 18 May 2015

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2015.01.020

zbMATH Keywords

error analysislossy compressionerror optimizationdeterministic tree automatonhyper-minimization

Mathematics Subject Classification ID

Formal languages and automata (68Q45)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Backward and forward bisimulation minimization of tree automata
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Minimizing nfa's and regular expressions
• Beyond Hyper-Minimisation--Minimising DBAs and DPAs is NP-Complete
• Hyper-minimization for Deterministic Tree Automata
• On Minimising Automata with Errors
• From Equivalence to Almost-Equivalence, and Beyond—Minimizing Automata with Errors
• Hyper-minimisation Made Efficient
• OPTIMAL HYPER-MINIMIZATION
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimizing minimized deterministic finite state automata
• UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION
• Rational and Recognisable Power Series
• Weighted Tree Automata and Tree Transducers
• Hyper-optimization for Deterministic Tree Automata
• HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA
• Bisimulation Minimisation for Weighted Tree Automata

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