dblp.uni-trier.dewww.uni-trier.de

Andreas Maletti

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

2008
21EEAndreas Maletti: Tree-Series-to-Tree-Series Transformations. CIAA 2008: 132-140
20EEJoost Engelfriet, Eric Lilin, Andreas Maletti: Extended Multi Bottom-Up Tree Transducers. Developments in Language Theory 2008: 289-300
19EEAndreas Maletti: Minimizing Deterministic Weighted Tree Automata. LATA 2008: 357-372
18EEAndreas Maletti: Myhill-Nerode Theorem for Recognizable Tree Series Revisited. LATIN 2008: 106-120
17EEAndreas Maletti: Compositions of extended top-down tree transducers. Inf. Comput. 206(9-10): 1187-1196 (2008)
2007
16EEAndreas Maletti: Learning Deterministically Recognizable Tree Series - Revisited. CAI 2007: 218-235
15EEJohanna Högberg, Andreas Maletti, Jonathan May: Backward and Forward Bisimulation Minimisation of Tree Automata. CIAA 2007: 109-121
14EEJohanna Högberg, Andreas Maletti, Jonathan May: Bisimulation Minimisation for Weighted Tree Automata. Developments in Language Theory 2007: 229-241
13EEAndreas Maletti: Pure and O-Substitution. Int. J. Found. Comput. Sci. 18(4): 829-845 (2007)
2006
12EEArmin Kühnemann, Andreas Maletti: The Substitution Vanishes. AMAST 2006: 173-188
11EEAndreas Maletti: Does o-Substitution Preserve Recognizability? CIAA 2006: 150-161
10EEAndreas Maletti: Hierarchies of Tree Series Transformations Revisited. Developments in Language Theory 2006: 215-225
9EEBjörn Borchardt, Andreas Maletti, Branimir Seselja, Andreja Tepavcevic, Heiko Vogler: Cut sets as recognizable tree languages. Fuzzy Sets and Systems 157(11): 1560-1571 (2006)
8EEAndreas Maletti: Compositions of tree series transformations. Theor. Comput. Sci. 366(3): 248-271 (2006)
2005
7EEAndreas Maletti: The Power of Tree Series Transducers of Type I and II. Developments in Language Theory 2005: 338-349
6EEAndreas Maletti: Relating tree series transducers and weighted tree automata. Int. J. Found. Comput. Sci. 16(4): 723-741 (2005)
5 Björn Borchardt, Zoltán Fülöp, Zsolt Gazdag, Andreas Maletti: Bounds for Tree Automata with Polynomial Costs. Journal of Automata, Languages and Combinatorics 10(2/3): 107-157 (2005)
4 Andreas Maletti, Heiko Vogler: Incomparability Results for Classes of Polynomial Tree Series Transformations. Journal of Automata, Languages and Combinatorics 10(4): 535-568 (2005)
3EEAndreas Maletti: HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. Theor. Comput. Sci. 339(2-3): 200-240 (2005)
2004
2EEAndreas Maletti: Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. CIAA 2004: 323-324
1EEAndreas Maletti: Relating Tree Series Transducers and Weighted Tree Automata. Developments in Language Theory 2004: 321-333

Coauthor Index

1Björn Borchardt [5] [9]
2Joost Engelfriet [20]
3Zoltán Fülöp [5]
4Zsolt Gazdag [5]
5Johanna Högberg [14] [15]
6Armin Kühnemann [12]
7Eric Lilin [20]
8Jonathan May [14] [15]
9Branimir Seselja [9]
10Andreja Tepavcevic [9]
11Heiko Vogler [4] [9]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)