Travelled to:
1 × Australia
1 × Czech Republic
1 × Finland
1 × Germany
1 × Italy
1 × Japan
1 × New Zealand
1 × Portugal
1 × Spain
2 × France
2 × Hungary
2 × Taiwan
2 × USA
4 × Canada
Collaborated with:
∅ D.Quernheim A.Jez Z.Ésik J.Högberg J.May Z.Fülöp M.Holzer M.Büchse H.Vogler J.Engelfriet E.Lilin
Talks about:
tree (24) automata (14) hyper (11) weight (10) minim (10) transduc (9) determinist (8) seri (6) extend (4) minimis (3)
Person: Andreas Maletti
DBLP: Maletti:Andreas
Contributed to:
Wrote 31 papers:
- AFL-2014-MalettiQ #automaton
- Hyper-Minimization for Deterministic Weighted Tree Automata (AM, DQ), pp. 314–326.
- CIAA-2014-Maletti #bottom-up #multi #power of #transducer
- The Power of Regularity-Preserving Multi Bottom-up Tree Transducers (AM), pp. 278–289.
- CIAA-2013-Maletti #automaton
- Hyper-optimization for Deterministic Tree Automata (AM), pp. 244–255.
- CIAA-J-2013-Maletti15 #automaton
- Hyper-optimization for deterministic tree automata (AM), pp. 72–87.
- DLT-2013-FulopM #composition #linear #top-down #transducer
- Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers (ZF, AM), pp. 239–251.
- CIAA-2012-JezM #automaton
- Hyper-minimization for Deterministic Tree Automata (AJ, AM), pp. 217–228.
- CIAA-J-2012-JezM13 #automaton
- Hyper-Minimization for Deterministic Tree Automata (AJ, AM), pp. 815–830.
- DLT-2012-BuchseMV #semantics
- Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars (MB, AM, HV), pp. 368–379.
- AFL-2011-Maletti
- Notes on Hyper-minimization (AM), pp. 34–49.
- AFL-2011-MalettiQ #automaton #finite
- Hyper-minimisation of deterministic weighted finite automata over semifields (AM, DQ), pp. 285–299.
- AFL-J-2011-MalettiQ12
- Unweighted and Weighted Hyper-Minimization (AM, DQ), pp. 1207–1226.
- CIAA-2011-JezM #automaton #performance
- Computing All ℓ-Cover Automata Fast (AJ, AM), pp. 203–214.
- CIAA-2010-EsikM #automaton #simulation
- Simulations of Weighted Tree Automata (ZÉ, AM), pp. 321–330.
- CIAA-2010-Maletti #fault #performance
- Better Hyper-minimization — Not as Fast, But Fewer Errors (AM), pp. 201–210.
- CIAA-J-2010-EsikM11 #automaton #simulation
- The Category of Simulations for Weighted Tree Automata (ZÉ, AM), pp. 1845–1859.
- CIAA-J-2010-MalettiQ11
- Optimal Hyper-Minimization (AM, DQ), pp. 1877–1891.
- DLT-2010-Maletti #top-down #transducer
- Input Products for Weighted Extended Top-Down Tree Transducers (AM), pp. 316–327.
- CIAA-2009-HolzerM #algorithm #automaton
- An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton (MH, AM), pp. 4–13.
- CIAA-2008-Maletti
- Tree-Series-to-Tree-Series Transformations (AM), pp. 132–140.
- DLT-2008-EngelfrietLM #bottom-up #multi #transducer
- Extended Multi Bottom-Up Tree Transducers (JE, EL, AM), pp. 289–300.
- LATA-2008-Maletti #automaton
- Minimizing Deterministic Weighted Tree Automata (AM), pp. 357–372.
- CIAA-2007-HogbergMM #automaton #bisimulation
- Backward and Forward Bisimulation Minimisation of Tree Automata (JH, AM, JM), pp. 109–121.
- DLT-2007-HogbergMM #automaton #bisimulation
- Bisimulation Minimisation for Weighted Tree Automata (JH, AM, JM), pp. 229–241.
- LATA-2007-Maletti #composition #top-down #transducer
- Compositions of Extended Top-down Tree Transducers (AM), pp. 379–390.
- CIAA-2006-Maletti #question
- Does o-Substitution Preserve Recognizability? (AM), pp. 150–161.
- CIAA-J-2006-Maletti07
- Pure and O-Substitution (AM), pp. 829–845.
- DLT-2006-Maletti #revisited
- Hierarchies of Tree Series Transformations Revisited (AM), pp. 215–225.
- DLT-2005-Maletti #power of #transducer
- The Power of Tree Series Transducers of Type I and II (AM), pp. 338–349.
- CIAA-2004-Maletti #theorem #transducer
- Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids (AM), pp. 323–324.
- DLT-2004-Maletti #automaton #transducer
- Relating Tree Series Transducers and Weighted Tree Automata (AM), pp. 321–333.
- DLT-J-2004-Maletti05 #automaton #transducer
- Relating tree series transducers and weighted tree automata (AM), pp. 723–741.