| Publication | Date of Publication | Type |
|---|
| Pumping Lemmata for Recognizable Weighted Languages over Artinian Semirings | 2024-04-09 | Paper |
| Weighted bottom-up and top-down tree transformations are incomparable | 2024-02-28 | Paper |
| Compositions of Weighted Extended Tree Transducers — The Unambiguous Case | 2024-02-16 | Paper |
| Weighted tree automata with constraints | 2024-02-09 | Paper |
| Weighted two-way transducers | 2024-02-02 | Paper |
| Ambiguity Hierarchies for Weighted Tree Automata | 2023-11-24 | Paper |
| Compositions with Constant Weighted Extended Tree Transducers | 2023-10-13 | Paper |
| Combinatory categorial grammars as generators of weighted forests | 2023-09-27 | Paper |
| Weighted two-way transducers | 2023-07-26 | Paper |
| The Tree-Generative Capacity of Combinatory Categorial Grammars. | 2023-02-03 | Paper |
| On Tree Substitution Grammars | 2022-10-13 | Paper |
| Weighted tree automata with constraints | 2022-08-11 | Paper |
| Compositions of constant weighted extended tree transducers | 2022-03-25 | Paper |
| Ambiguity hierarchies for weighted tree automata | 2022-03-22 | Paper |
| The tree-generative capacity of combinatory categorial grammars | 2021-11-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994953 | 2021-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994130 | 2021-06-17 | Paper |
| Composition closure of linear weighted extended top-down tree transducers | 2020-05-06 | Paper |
| Compositions of Tree-to-Tree Statistical Machine Translation Models | 2018-09-20 | Paper |
| Multiple context-free tree grammars: lexicalization and characterization | 2018-05-17 | Paper |
| Pushing for weighted tree automata | 2018-01-23 | Paper |
| Multiple context-free tree grammars and multi-component tree adjoining grammars | 2017-11-22 | Paper |
| Synchronous Forest Substitution Grammars | 2017-08-25 | Paper |
| Survey: finite-state technology in natural language processing | 2017-06-19 | Paper |
| Composition closure of linear extended top-down tree transducers | 2017-03-31 | Paper |
| Compositions of Tree-to-Tree Statistical Machine Translation Models | 2016-08-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740410 | 2016-07-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740428 | 2016-07-26 | Paper |
| Linking theorems for tree transducers | 2016-07-15 | Paper |
| The Power of Weighted Regularity-Preserving Multi Bottom-Up Tree Transducers | 2016-02-17 | Paper |
| Hyper-optimization for deterministic tree automata | 2015-05-18 | Paper |
| The Power of Regularity-Preserving Multi Bottom-up Tree Transducers | 2014-09-26 | Paper |
| Book review of: Lance Fortnow, The golden ticket. P, NP, and the search for the impossible | 2014-04-30 | Paper |
| HYPER-MINIMIZATION FOR DETERMINISTIC TREE AUTOMATA | 2014-03-10 | Paper |
| Synchronous Forest Substitution Grammars | 2013-09-20 | Paper |
| Hyper-optimization for Deterministic Tree Automata | 2013-08-07 | Paper |
| Composition Closure of ε-Free Linear Extended Top-Down Tree Transducers | 2013-06-28 | Paper |
| UNWEIGHTED AND WEIGHTED HYPER-MINIMIZATION | 2013-06-06 | Paper |
| Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars | 2012-11-02 | Paper |
| Hyper-minimization for deterministic tree automata | 2012-09-20 | Paper |
| Survey: Weighted extended top-down tree transducers. I. Basics and expressive power | 2012-09-18 | Paper |
| Weighted extended tree transducers | 2012-05-04 | Paper |
| Survey: Weighted extended top-down tree transducers. II. Application in machine translation | 2012-05-04 | Paper |
| MAT learners for tree series: an abstract data type and two realizations | 2012-03-23 | Paper |
| THE CATEGORY OF SIMULATIONS FOR WEIGHTED TREE AUTOMATA | 2012-03-13 | Paper |
| OPTIMAL HYPER-MINIMIZATION | 2012-03-13 | Paper |
| Survey: Weighted extended top-down tree transducers. III. Composition | 2011-11-11 | Paper |
| Tree transformations and dependencies | 2011-10-07 | Paper |
| Pushing for weighted tree automata | 2011-08-17 | Paper |
| On minimising automata with errors | 2011-08-17 | Paper |
| Computing all \(\ell \)-cover automata fast | 2011-07-29 | Paper |
| Simulations of weighted tree automata | 2011-02-11 | Paper |
| Better hyper-minimization. Not as fast, but fewer errors | 2011-02-11 | Paper |
| An \(n\log n\) algorithm for hyper-minimizing a (minimized) deterministic automaton | 2010-10-07 | Paper |
| Input products for weighted extended top-down tree transducers | 2010-08-31 | Paper |
| Properties of quasi-relabeling tree bimorphisms | 2010-06-18 | Paper |
| Minimizing deterministic weighted tree automata | 2009-11-27 | Paper |
| Extended multi bottom-up tree transducers | 2009-11-18 | Paper |
| A Backward and a Forward Simulation for Weighted Tree Automata | 2009-11-05 | Paper |
| Syntax-Directed Translations and Quasi-alphabetic Tree Bimorphisms — Revisited | 2009-11-05 | Paper |
| Backward and forward bisimulation minimization of tree automata | 2009-09-14 | Paper |
| A Kleene theorem for weighted tree automata over distributive multioperator monoids | 2009-08-06 | Paper |
| An nlogn Algorithm for Hyper-minimizing States in a (Minimized) Deterministic Automaton | 2009-07-09 | Paper |
| Bisimulation Minimisation of Weighted Automata on Unranked Trees | 2009-06-30 | Paper |
| The Substitution Vanishes | 2009-04-28 | Paper |
| Hierarchies of Tree Series Transformations Revisited | 2009-03-26 | Paper |
| Tree-Series-to-Tree-Series Transformations | 2009-02-12 | Paper |
| Minimizing Deterministic Weighted Tree Automata | 2008-11-20 | Paper |
| Extended Multi Bottom-Up Tree Transducers | 2008-10-30 | Paper |
| Compositions of extended top-down tree transducers | 2008-10-08 | Paper |
| Learning Deterministically Recognizable Tree Series — Revisited | 2008-09-04 | Paper |
| Backward and Forward Bisimulation Minimisation of Tree Automata | 2008-06-10 | Paper |
| PURE AND O-SUBSTITUTION | 2008-05-20 | Paper |
| Myhill-Nerode Theorem for Recognizable Tree Series Revisited | 2008-04-15 | Paper |
| Incomparability results for classes of polynomial tree series transformations | 2008-01-18 | Paper |
| Bisimulation Minimisation for Weighted Tree Automata | 2007-11-28 | Paper |
| Does o-Substitution Preserve Recognizability? | 2007-09-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3431475 | 2007-04-10 | Paper |
| Compositions of tree series transformations | 2007-01-09 | Paper |
| Developments in Language Theory | 2006-06-23 | Paper |
| Cut sets as recognizable tree languages | 2006-06-16 | Paper |
| Developments in Language Theory | 2005-12-22 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| RELATING TREE SERIES TRANSDUCERS AND WEIGHTED TREE AUTOMATA | 2005-08-03 | Paper |
| Hasse diagrams for classes of deterministic bottom-up tree-to-tree-series transformations | 2005-06-30 | Paper |
