Hyper-optimization for deterministic tree automata
From MaRDI portal
Publication:2344747
DOI10.1016/J.TCS.2015.01.020zbMATH Open1319.68138OpenAlexW2044036493MaRDI QIDQ2344747FDOQ2344747
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
Recommendations
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Backward and forward bisimulation minimization of tree automata
- Title not available (Why is that?)
- Title not available (Why is that?)
- Weighted tree automata and tree transducers
- An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton
- Minimizing nfa's and regular expressions
- Hyper-minimisation Made Efficient
- Hyper-minimizing minimized deterministic finite state automata
- On minimising automata with errors
- From equivalence to almost-equivalence, and beyond-minimizing automata with errors (extended abstract)
- Rational and Recognisable Power Series
- OPTIMAL HYPER-MINIMIZATION
- HYPER-MINIMIZATION IN O(n2)
- Bisimulation Minimisation for Weighted Tree Automata
- Beyond hyper-minimisation -- minimising DBAs and DPAs is NP-complete
- Hyper-minimization for deterministic tree automata
- Title not available (Why is that?)
- Unweighted and weighted hyper-minimization
- Hyper-optimization for deterministic tree automata
- Hyper-minimization for deterministic tree automata
- Hyper-minimisation of deterministic weighted finite automata over semifields
Cited In (6)
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)
