Search the dblp DataBase

Publications of Author

1. Armin Kühnemann, Andreas Maletti
   The Substitution Vanishes. [Citation Graph (0, 0)][DBLP]
   AMAST, 2006, pp:173-188 [Conf]
   
2. Andreas Maletti
   Relating Tree Series Transducers and Weighted Tree Automata. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2004, pp:321-333 [Conf]
   
3. Andreas Maletti
   The Power of Tree Series Transducers of Type I and II. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2005, pp:338-349 [Conf]
   
4. Andreas Maletti
   Hierarchies of Tree Series Transformations Revisited. [Citation Graph (0, 0)][DBLP]
   Developments in Language Theory, 2006, pp:215-225 [Conf]
   
5. Andreas Maletti
   Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. [Citation Graph (0, 0)][DBLP]
   CIAA, 2004, pp:323-324 [Conf]
   
6. Andreas Maletti
   Does o-Substitution Preserve Recognizability? [Citation Graph (0, 0)][DBLP]
   CIAA, 2006, pp:150-161 [Conf]
   
7. Björn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler
   Cut sets as recognizable tree languages. [Citation Graph (0, 0)][DBLP]
   Fuzzy Sets and Systems, 2006, v:157, n:11, pp:1560-1571 [Journal]
   
8. Andreas Maletti
   Relating tree series transducers and weighted tree automata. [Citation Graph (0, 0)][DBLP]
   Int. J. Found. Comput. Sci., 2005, v:16, n:4, pp:723-741 [Journal]
   
9. Andreas Maletti
   HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. [Citation Graph (0, 0)][DBLP]
   Theor. Comput. Sci., 2005, v:339, n:2-3, pp:200-240 [Journal]
   
10. Andreas Maletti
    Compositions of tree series transformations. [Citation Graph (0, 0)][DBLP]
    Theor. Comput. Sci., 2006, v:366, n:3, pp:248-271 [Journal]
    
11. Johanna Högberg, Andreas Maletti, Jonathan May
    Bisimulation Minimisation for Weighted Tree Automata. [Citation Graph (0, 0)][DBLP]
    Developments in Language Theory, 2007, pp:229-241 [Conf]
    
12. Johanna Högberg, Andreas Maletti, Jonathan May
    Backward and Forward Bisimulation Minimisation of Tree Automata. [Citation Graph (0, 0)][DBLP]
    CIAA, 2007, pp:109-121 [Conf]
    
13. 
    Extended Multi Bottom-Up Tree Transducers. [Citation Graph (, )][DBLP]
    
    
14. 
    Input Products for Weighted Extended Top-Down Tree Transducers. [Citation Graph (, )][DBLP]
    
    
15. 
    Parsing Algorithms based on Tree Automata. [Citation Graph (, )][DBLP]
    
    
16. 
    Myhill-Nerode Theorem for Recognizable Tree Series Revisited. [Citation Graph (, )][DBLP]
    
    
17. 
    Tree-Series-to-Tree-Series Transformations. [Citation Graph (, )][DBLP]
    
    
18. 
    An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. [Citation Graph (, )][DBLP]
    
    
19. 
    Minimizing Weighted Tree Grammars Using Simulation. [Citation Graph (, )][DBLP]
    
    
20. 
    Compositions of Top-Down Tree Transducers with epsilon-Rules. [Citation Graph (, )][DBLP]
    
    
21. 
    Learning Deterministically Recognizable Tree Series - Revisited. [Citation Graph (, )][DBLP]
    
    
22. 
    A Backward and a Forward Simulation for Weighted Tree Automata. [Citation Graph (, )][DBLP]
    
    
23. 
    Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. [Citation Graph (, )][DBLP]
    
    
24. 
    Minimizing Deterministic Weighted Tree Automata. [Citation Graph (, )][DBLP]
    
    
25. 
    Extended multi bottom-up tree transducers. [Citation Graph (, )][DBLP]
    
    
26. 
    Properties of quasi-alphabetic tree bimorphisms [Citation Graph (, )][DBLP]
    
    
27. 
    Simulation vs. Equivalence [Citation Graph (, )][DBLP]
    
    
28. 
    Simulations of Weighted Tree Automata [Citation Graph (, )][DBLP]