Myhill-Nerode Theorem for Sequential Transducers over Unique GCD-Monoids. - Andreas Maletti (CIAA, 2004)

The Power of Tree Series Transducers of Type I and II. - Andreas Maletti (Developments in Language Theory, 2005)

Relating tree series transducers and weighted tree automata. - Andreas Maletti (Int. J. Found. Comput. Sci., 2005)

Bounds for Tree Automata with Polynomial Costs. - Björn Borchardt; Zoltán Fülöp 001; Zsolt Gazdag; Andreas Maletti (J. Autom. Lang. Comb., 2005)

Incomparability Results for Classes of Polynomial Tree Series Transformations. - Andreas Maletti; Heiko Vogler (J. Autom. Lang. Comb., 2005)

HASSE diagrams for classes of deterministic bottom-up tree-to-tree-series transformations. - Andreas Maletti (Theor. Comput. Sci., 2005)

The Substitution Vanishes. - Armin Kühnemann; Andreas Maletti (AMAST, 2006)

Hierarchies of Tree Series Transformations Revisited. - Andreas Maletti (Developments in Language Theory, 2006)

Does o-Substitution Preserve Recognizability? - Andreas Maletti (CIAA, 2006)

Cut sets as recognizable tree languages. - Björn Borchardt; Andreas Maletti; Branimir Seselja; Andreja Tepavcevic; Heiko Vogler (Fuzzy Sets Syst., 2006)

Compositions of tree series transformations. - Andreas Maletti (Theor. Comput. Sci., 2006)

The power of tree series transducers. - Andreas Maletti (2006)

Learning Deterministically Recognizable Tree Series - Revisited. - Andreas Maletti (CAI, 2007)

Bisimulation Minimisation for Weighted Tree Automata. - Johanna Högberg; Andreas Maletti; Jonathan May (Developments in Language Theory, 2007)

Backward and Forward Bisimulation Minimisation of Tree Automata. - Johanna Högberg; Andreas Maletti; Jonathan May (CIAA, 2007)

Pure and O-Substitution. - Andreas Maletti (Int. J. Found. Comput. Sci., 2007)

Myhill-Nerode Theorem for Recognizable Tree Series Revisited. - Andreas Maletti (LATIN, 2008)

Tree-Series-to-Tree-Series Transformations. - Andreas Maletti (CIAA, 2008)

Compositions of extended top-down tree transducers. - Andreas Maletti (Inf. Comput., 2008)

A Backward and a Forward Simulation for Weighted Tree Automata. - Andreas Maletti (CAI, 2009)

Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms - Revisited. - Andreas Maletti; Catalin Ionut Tîrnauca (CAI, 2009)

Minimizing Weighted Tree Grammars Using Simulation. - Andreas Maletti (FSMNLP, 2009)

Compositions of Top-Down Tree Transducers with epsilon-Rules. - Andreas Maletti; Heiko Vogler (FSMNLP, 2009)

Parsing Algorithms based on Tree Automata. - Andreas Maletti; Giorgio Satta (IWPT, 2009)

An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton. - Markus Holzer 001; Andreas Maletti (CIAA, 2009)

Extended multi bottom-up tree transducers. - Joost Engelfriet; Eric Lilin; Andreas Maletti (Acta Informatica, 2009)

Properties of quasi-alphabetic tree bimorphisms - Andreas Maletti; Catalin Ionut Tîrnauca (CoRR, 2009)

Bisimulation Minimisation of Weighted Automata on Unranked Trees. - Johanna Högberg; Andreas Maletti; Heiko Vogler (Fundam. Informaticae, 2009)

Minimizing deterministic weighted tree automata. - Andreas Maletti (Inf. Comput., 2009)

A Kleene Theorem for Weighted Tree Automata over Distributive Multioperator Monoids. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Theory Comput. Syst., 2009)

The Power of Extended Top-Down Tree Transducers. - Andreas Maletti; Jonathan Graehl; Mark Hopkins; Kevin Knight (SIAM J. Comput., 2009)

Backward and forward bisimulation minimization of tree automata. - Johanna Högberg; Andreas Maletti; Jonathan May (Theor. Comput. Sci., 2009)

Preservation of Recognizability for Synchronous Tree Substitution Grammars. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (ATANLP@ACL 2010, 2010)

A Tree Transducer Model for Synchronous Tree-Adjoining Grammars. - Andreas Maletti (ACL, 2010)

Parsing and Translation Algorithms Based on Weighted Extended Tree Transducers. - Andreas Maletti; Giorgio Satta (ATANLP@ACL 2010, 2010)

Input Products for Weighted Extended Top-Down Tree Transducers. - Andreas Maletti (Developments in Language Theory, 2010)

Simulation vs. Equivalence. - Zoltán Ésik; Andreas Maletti (FCS, 2010)

Why Synchronous Tree Substitution Grammars? - Andreas Maletti (HLT-NAACL, 2010)

Survey: Tree Transducers in Machine Translation. - Andreas Maletti (NCMA, 2010)

Simulations of Weighted Tree Automata. - Zoltán Ésik; Andreas Maletti (CIAA, 2010)

Better Hyper-minimization - Not as Fast, But Fewer Errors. - Andreas Maletti (CIAA, 2010)

Properties of Quasi-Relabeling Tree Bimorphisms. - Andreas Maletti; Catalin Ionut Tîrnauca (Int. J. Found. Comput. Sci., 2010)

An nlogn algorithm for hyper-minimizing a (minimized) deterministic automaton. - Markus Holzer 001; Andreas Maletti (Theor. Comput. Sci., 2010)

How to train your multi bottom-up tree transducer. - Andreas Maletti (ACL, 2011)

Notes on Hyper-minimization. - Andreas Maletti (AFL, 2011)

Hyper-minimisation of deterministic weighted finite automata over semifields. - Andreas Maletti; Daniel Quernheim (AFL, 2011)

Survey: Weighted Extended Top-Down Tree Transducers Part III - Composition. - Aurélie Lagoutte; Andreas Maletti (Algebraic Foundations in Computer Science, 2011)

On Minimising Automata with Errors. - Pawel Gawrychowski; Artur Jez; Andreas Maletti (MFCS, 2011)

Pushing for Weighted Tree Automata. - Andreas Maletti; Daniel Quernheim (MFCS, 2011)

Tree Transformations and Dependencies. - Andreas Maletti (MOL, 2011)

Computing All ℓ-Cover Automata Fast. - Artur Jez; Andreas Maletti (CIAA, 2011)

MAT learners for tree series: an abstract data type and two realizations. - Frank Drewes; Johanna Högberg; Andreas Maletti (Acta Informatica, 2011)

Survey: Weighted Extended Top-down Tree Transducers Part I - Basics and Expressive Power. - Andreas Maletti (Acta Cybern., 2011)

Weighted Extended Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti; Heiko Vogler (Fundam. Informaticae, 2011)

Survey: Weighted Extended Top-down Tree Transducers Part II - Application in Machine Translation. - Andreas Maletti (Fundam. Informaticae, 2011)

The Category of Simulations for Weighted Tree Automata. - Zoltán Ésik; Andreas Maletti (Int. J. Found. Comput. Sci., 2011)

Optimal Hyper-Minimization. - Andreas Maletti; Daniel Quernheim (Int. J. Found. Comput. Sci., 2011)

An alternative to synchronous tree substitution grammars. - Andreas Maletti (Nat. Lang. Eng., 2011)

Strong Lexicalization of Tree Adjoining Grammars. - Andreas Maletti; Joost Engelfriet (ACL (1), 2012)

Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars. - Matthias Büchse; Andreas Maletti; Heiko Vogler (Developments in Language Theory, 2012)

Composing extended top-down tree transducers. - Aurélie Lagoutte; Fabienne Braune; Daniel Quernheim; Andreas Maletti (EACL, 2012)

Preservation of Recognizability for Weighted Linear Extended Top-Down Tree Transducers. - Nina Seemann; Daniel Quernheim; Fabienne Braune; Andreas Maletti (ATANLP@EACL, 2012)

Every sensible extended top-down tree transducer is a multi bottom-up tree transducer. - Andreas Maletti (HLT-NAACL, 2012)

Unweighted and Weighted Hyper-Minimization. - Andreas Maletti; Daniel Quernheim (Int. J. Found. Comput. Sci., 2012)

Shallow Local Multi-Bottom-up Tree Transducers in Statistical Machine Translation. - Fabienne Braune; Nina Seemann; Daniel Quernheim; Andreas Maletti (ACL (1), 2013)

Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti (Developments in Language Theory, 2013)

Random Generation of Nondeterministic Finite-State Tree Automata. - Thomas Hanneforth; Andreas Maletti; Daniel Quernheim (TTATT, 2013)

Composition Closure of Linear Extended Top-down Tree Transducers - Zoltán Fülöp 001; Andreas Maletti (CoRR, 2013)

Hyper-Minimization for Deterministic Tree Automata. - Artur Jez; Andreas Maletti (Int. J. Found. Comput. Sci., 2013)

DIMwid - Decoder Inspection for Moses (using Widgets). - Robin Kurtz; Nina Seemann; Fabienne Braune; Andreas Maletti (Prague Bull. Math. Linguistics, 2013)

A tunable language model for statistical machine translation. - Junfei Guo; Juan Liu; Qi Han 006; Andreas Maletti (AMTA, 2014)

The Power of Regularity-Preserving Multi Bottom-up Tree Transducers. - Andreas Maletti (CIAA, 2014)

Hyper-Minimization for Deterministic Weighted Tree Automata. - Andreas Maletti; Daniel Quernheim (AFL, 2014)

Grammars, Parsers and Recognizers. - Harry Bunt; Andreas Maletti; Joakim Nivre (J. Log. Comput., 2014)

String-to-Tree Multi Bottom-up Tree Transducers. - Nina Seemann; Fabienne Braune; Andreas Maletti (ACL (1), 2015)

Extended Tree Transducers in Natural Language Processing. - Andreas Maletti (FSMNLP, 2015)

A systematic evaluation of MBOT in statistical machine translation. - Nina Seemann; Fabienne Braune; Andreas Maletti (MTSummit, 2015)

Discontinuous Statistical Machine Translation with Target-Side Dependency Syntax. - Nina Seemann; Andreas Maletti (WMT@EMNLP, 2015)

The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers. - Andreas Maletti (Int. J. Found. Comput. Sci., 2015)

Hyper-optimization for deterministic tree automata. - Andreas Maletti (Theor. Comput. Sci., 2015)

Linking theorems for tree transducers. - Zoltán Fülöp 001; Andreas Maletti (J. Comput. Syst. Sci., 2016)

Multiple Context-Free Tree Grammars and Multi-component Tree Adjoining Grammars. - Joost Engelfriet; Andreas Maletti (FCT, 2017)

Synchronous Forest Substitution Grammars. - Andreas Maletti (Acta Cybern., 2017)

Composition Closure of Linear Extended Top-down Tree Transducers. - Joost Engelfriet; Zoltán Fülöp 001; Andreas Maletti (Theory Comput. Syst., 2017)

Survey: Finite-state technology in natural language processing. - Andreas Maletti (Theor. Comput. Sci., 2017)

Recurrent Neural Networks as Weighted Language Recognizers. - Yining Chen; Sorcha Gilroy; Andreas Maletti; Jonathan May; Kevin Knight (NAACL-HLT, 2018)

Compositions of Tree-to-Tree Statistical Machine Translation Models. - Andreas Maletti (Int. J. Found. Comput. Sci., 2018)

Pushing for weighted tree automata. - Thomas Hanneforth; Andreas Maletti; Daniel Quernheim (Log. Methods Comput. Sci., 2018)

Multiple context-free tree grammars: Lexicalization and characterization. - Joost Engelfriet; Andreas Maletti; Sebastian Maneth (Theor. Comput. Sci., 2018)

Composition Closure of Linear Weighted Extended Top-Down Tree Transducers. - Zoltán Fülöp 001; Andreas Maletti (CIAA, 2019)

On Tree Substitution Grammars. - Andreas Maletti; Kevin Stier (DLT, 2020)

Strong Equivalence of TAG and CCG. - Lena Katharina Schiffer; Andreas Maletti (Trans. Assoc. Comput. Linguistics, 2021)

Preface. - Manfred Droste; Andreas Maletti; Heiko Vogler (Inf. Comput., 2022)

The tree-generative capacity of combinatory categorial grammars. - Marco Kuhlmann; Andreas Maletti; Lena Katharina Schiffer (J. Comput. Syst. Sci., 2022)

Weighted Bottom-Up and Top-Down Tree Transformations Are Incomparable. - Andreas Maletti; Andreea-Teodora Nász (CIAA, 2023)

Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings. - Andreas Maletti; Nils Oskar Nuernbergk (AFL, 2023)

Compositions with Constant Weighted Extended Tree Transducers. - Malte Blattmann; Andreas Maletti (Int. J. Found. Comput. Sci., 2023)

Combinatory categorial grammars as generators of weighted forests. - Andreas Maletti; Lena Katharina Schiffer (Inf. Comput., 2023)

Weighted two-way transducers. - Fan Feng; Andreas Maletti (Inf. Comput., 2023)

Ambiguity Hierarchies for Weighted Tree Automata. - Andreas Maletti; Teodora Nasz; Kevin Stier; Markus Ulbricht 001 (Int. J. Found. Comput. Sci., 2023)

Weighted HOM-Problem for Nonnegative Integers. - Andreas Maletti; Andreea-Teodora Nász; Erik Paul (STACS, 2024)

Compositions of Weighted Extended Tree Transducers - The Unambiguous Case. - Andreas Maletti (Int. J. Found. Comput. Sci., 2024)

Weighted Tree Automata with Constraints. - Andreas Maletti; Andreea-Teodora Nász (Theory Comput. Syst., 2024)