Hyper-optimization for deterministic tree automata

DOI10.1016/J.TCS.2015.01.020MaRDI QIDQ2344747zbMATH OpenOpenAlexFDO

Authors 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)

Recommendations

• Hyper-optimization for deterministic tree automata
• Hyper-minimization for deterministic tree automata
• Hyper-minimization for deterministic tree automata
• Better hyper-minimization. Not as fast, but fewer errors
• Hyper-minimisation Made Efficient

Cites work

• scientific article; zbMATH DE number 54244 (Why is no real title available?)
• scientific article; zbMATH DE number 3460178 (Why is no real title available?)
• scientific article; zbMATH DE number 3615891 (Why is no real title available?)
• scientific article; zbMATH DE number 2150300 (Why is no real title available?)
• scientific article; zbMATH DE number 941396 (Why is no real title available?)
• An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
• Backward and forward bisimulation minimization of tree automata
• Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
• Bisimulation Minimisation for Weighted Tree Automata
• From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)
• HYPER-MINIMIZATION IN O(n²)
• Hyper-minimisation Made Efficient
• Hyper-minimisation of deterministic weighted finite automata over semifields
• Hyper-minimization for deterministic tree automata
• Hyper-minimization for deterministic tree automata
• Hyper-minimizing minimized deterministic finite state automata
• Hyper-optimization for deterministic tree automata
• Minimizing nfa's and regular expressions
• OPTIMAL HYPER-MINIMIZATION
• On minimising automata with errors
• Rational and Recognisable Power Series
• Unweighted and weighted hyper-minimization
• Weighted tree automata and tree transducers

Cited in

(6)

• Hyper-minimization for deterministic tree automata
• Hyper-minimization for deterministic tree automata
• Hyper-optimization for deterministic tree automata
• scientific article; zbMATH DE number 7361973 (Why is no real title available?)
• Better hyper-minimization. Not as fast, but fewer errors
• Notes on hyper-minimization

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

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