| * | 2009 |
|---|
| 28 | EE | Andreas Maletti:
A Backward and a Forward Simulation for Weighted Tree Automata.
CAI 2009: 288-304 |
| 27 | EE | Andreas Maletti,
Catalin Ionut Tîrnauca:
Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited.
CAI 2009: 305-317 |
| 26 | EE | Markus Holzer,
Andreas Maletti:
An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton.
CIAA 2009: 4-13 |
| 25 | EE | Andreas Maletti,
Catalin Ionut Tîrnauca:
Properties of quasi-alphabetic tree bimorphisms
CoRR abs/0906.2369: (2009) |
| 24 | EE | Johanna Högberg,
Andreas Maletti,
Heiko Vogler:
Bisimulation Minimisation of Weighted Automata on Unranked Trees.
Fundam. Inform. 92(1-2): 103-130 (2009) |
| 23 | EE | Andreas Maletti:
Minimizing deterministic weighted tree automata.
Inf. Comput. 207(11): 1284-1299 (2009) |
| 22 | EE | Johanna Högberg,
Andreas Maletti,
Jonathan May:
Backward and forward bisimulation minimization of tree automata.
Theor. Comput. Sci. 410(37): 3539-3552 (2009) |
| 2008 |
|---|
| 21 | EE | Andreas Maletti:
Tree-Series-to-Tree-Series Transformations.
CIAA 2008: 132-140 |
| 20 | EE | Joost Engelfriet,
Eric Lilin,
Andreas Maletti:
Extended Multi Bottom-Up Tree Transducers.
Developments in Language Theory 2008: 289-300 |
| 19 | EE | Andreas Maletti:
Minimizing Deterministic Weighted Tree Automata.
LATA 2008: 357-372 |
| 18 | EE | Andreas Maletti:
Myhill-Nerode Theorem for Recognizable Tree Series Revisited.
LATIN 2008: 106-120 |
| 17 | EE | Andreas Maletti:
Compositions of extended top-down tree transducers.
Inf. Comput. 206(9-10): 1187-1196 (2008) |
| 2007 |
|---|
| 16 | EE | Andreas Maletti:
Learning Deterministically Recognizable Tree Series - Revisited.
CAI 2007: 218-235 |
| 15 | EE | Johanna Högberg,
Andreas Maletti,
Jonathan May:
Backward and Forward Bisimulation Minimisation of Tree Automata.
CIAA 2007: 109-121 |
| 14 | EE | Johanna Högberg,
Andreas Maletti,
Jonathan May:
Bisimulation Minimisation for Weighted Tree Automata.
Developments in Language Theory 2007: 229-241 |
| 13 | EE | Andreas Maletti:
Pure and O-Substitution.
Int. J. Found. Comput. Sci. 18(4): 829-845 (2007) |
| 2006 |
|---|
| 12 | EE | Armin Kühnemann,
Andreas Maletti:
The Substitution Vanishes.
AMAST 2006: 173-188 |
| 11 | EE | Andreas Maletti:
Does o-Substitution Preserve Recognizability?
CIAA 2006: 150-161 |
| 10 | EE | Andreas Maletti:
Hierarchies of Tree Series Transformations Revisited.
Developments in Language Theory 2006: 215-225 |
| 9 | EE | Bjö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) |
| 8 | EE | Andreas Maletti:
Compositions of tree series transformations.
Theor. Comput. Sci. 366(3): 248-271 (2006) |
| 2005 |
|---|
| 7 | EE | Andreas Maletti:
The Power of Tree Series Transducers of Type I and II.
Developments in Language Theory 2005: 338-349 |
| 6 | EE | Andreas 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) |
| 3 | EE | Andreas Maletti:
HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations.
Theor. Comput. Sci. 339(2-3): 200-240 (2005) |
| 2004 |
|---|
| 2 | EE | Andreas Maletti:
Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids.
CIAA 2004: 323-324 |
| 1 | EE | Andreas Maletti:
Relating Tree Series Transducers and Weighted Tree Automata.
Developments in Language Theory 2004: 321-333 |
