| Publication | Date of Publication | Type |
|---|
| Rational weighted tree languages with storage | 2024-12-03 | Paper |
| A Comparison of Sets of Recognizable Weighted Tree Languages Over Specific Sets of Bounded Lattices | 2024-02-16 | Paper |
| Hybrid tree automata and the yield theorem for constituent tree automata | 2023-10-26 | Paper |
| Crisp-determinization of weighted tree automata over strong bimonoids | 2022-09-30 | Paper |
| Hybrid tree automata and the yield theorem for constituent tree automata | 2022-08-16 | Paper |
| Finite-image property of weighted tree automata over past-finite monotonic strong bimonoids | 2022-05-10 | Paper |
| Weighted Tree Automata and Tree Transducers | 2022-04-28 | Paper |
| Principal abstract families of weighted tree languages | 2022-01-06 | Paper |
| Weighted parsing for grammar-based language models over multioperator monoids | 2021-11-25 | Paper |
| Crisp-determinization of weighted tree automata over additively locally finite and past-finite monotonic strong bimonoids is decidable | 2021-07-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386623 | 2021-01-05 | Paper |
| Rational weighted tree languages with storage and the Kleene-Goldstine theorem | 2020-04-29 | Paper |
| Weighted automata with storage | 2019-12-18 | Paper |
| Weighted iterated linear control | 2019-06-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4560250 | 2018-12-10 | Paper |
| Characterizations of recognizable weighted tree languages by logic and bimorphisms | 2018-10-22 | Paper |
| Non-self-embedding linear context-free tree grammars generate regular tree languages | 2017-06-13 | Paper |
| Determinization of weighted tree automata using factorizations | 2016-09-29 | Paper |
| Weighted Symbolic Automata with Data Storage | 2016-08-30 | Paper |
| A Weighted MSO Logic with Storage Behaviour and Its Büchi-Elgot-Trakhtenbrot Theorem | 2016-04-13 | Paper |
| Weighted Unranked Tree Automata over Tree Valuation Monoids and Their Characterization by Weighted Logics | 2015-09-22 | Paper |
| A Chomsky-Schützenberger Theorem for Weighted Automata with Storage | 2015-09-22 | Paper |
| Characterizing weighted MSO for trees by branching transitive closure logics | 2015-07-24 | Paper |
| THE CHOMSKY-SCHÜTZENBERGER THEOREM FOR QUANTITATIVE CONTEXT-FREE LANGUAGES | 2015-04-23 | Paper |
| Forward and backward application of symbolic tree transducers | 2014-08-29 | Paper |
| Tree parsing for tree-adjoining machine translation | 2014-05-12 | Paper |
| The Chomsky-Schützenberger Theorem for Quantitative Context-Free Languages | 2013-06-28 | Paper |
| A Büchi-like theorem for weighted tree automata over multioperator monoids | 2012-12-06 | Paper |
| Unidirectional Derivation Semantics for Synchronous Tree-Adjoining Grammars | 2012-11-02 | Paper |
| Weighted extended tree transducers | 2012-05-04 | Paper |
| Weighted automata and multi-valued logics over arbitrary bounded lattices | 2012-03-13 | Paper |
| Weighted logics for unranked tree automata | 2011-04-01 | Paper |
| Determinization of weighted finite automata over strong bimonoids | 2010-09-08 | Paper |
| Kleene and Büchi Theorems for Weighted Automata and Multi-valued Logics over Arbitrary Bounded Lattices | 2010-08-31 | Paper |
| Weighted automata with discounting | 2010-04-19 | Paper |
| Weighted finite automata over strong bimonoids | 2010-01-28 | Paper |
| A note on cut-worthiness of recognizable tree series | 2009-08-28 | Paper |
| A Kleene theorem for weighted tree automata over distributive multioperator monoids | 2009-08-06 | Paper |
| A bottom-up characterization of deterministic top-down tree transducers with regular look-ahead | 2009-07-21 | Paper |
| Bisimulation Minimisation of Weighted Automata on Unranked Trees | 2009-06-30 | Paper |
| DECOMPOSITION OF WEIGHTED MULTIOPERATOR TREE AUTOMATA | 2009-06-23 | Paper |
| Weighted monadic Datalog | 2008-09-16 | Paper |
| Learning deterministically recognizable tree series | 2008-08-12 | Paper |
| Incomparability results for classes of polynomial tree series transformations | 2008-01-18 | Paper |
| Weighted tree automata and weighted logics | 2007-01-09 | Paper |
| Cut sets as recognizable tree languages | 2006-06-16 | Paper |
| Linear deterministic multi bottom-up tree transducers | 2005-12-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4672910 | 2005-04-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4654640 | 2005-03-08 | Paper |
| A Kleene theorem for weighted tree automata | 2005-02-24 | Paper |
| On the Determinization of Weighted Finite Automata | 2004-10-05 | Paper |
| Syntactic composition of top-down tree transducers is short cut fusion | 2004-09-24 | Paper |
| Hierarchies of tree series transformations | 2004-08-06 | Paper |
| Tree series transformations that respect copying | 2003-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150247 | 2002-12-10 | Paper |
| The equivalence of bottom-up and top-down tree-to-graph transducers | 2002-11-24 | Paper |
| The universality of higher-order attributed tree transducers | 2001-10-07 | Paper |
| A characterization of attributed tree transformations by a subclass of macro tree transducers | 2000-01-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259952 | 1999-09-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4236234 | 1999-03-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4210160 | 1998-09-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4345251 | 1997-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4311194 | 1995-08-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4318904 | 1995-02-06 | Paper |
| Synthesized and inherited functions. A new computational model for syntax-directed semantics | 1994-12-18 | Paper |
| The translation power of top-down tree-to-graph transducers | 1994-12-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4304751 | 1994-08-31 | Paper |
| Tree transducers with external functions | 1993-05-16 | Paper |
| An implementation of syntax directed functional programming on nested- stack machines | 1992-09-27 | Paper |
| Functional description of the contextual analysis in block-structured programming languages: A case study of tree transducers | 1992-06-28 | Paper |
| Modular tree transducers | 1991-01-01 | Paper |
| High level tree transducers and iterated pushdown tree transducers | 1988-01-01 | Paper |
| The OI-hierarchy is closed under control | 1988-01-01 | Paper |
| Basic tree transducers | 1987-01-01 | Paper |
| Look-ahead on pushdowns | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779780 | 1987-01-01 | Paper |
| Pushdown machines for the macro tree transducer | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4723316 | 1986-01-01 | Paper |
| Corrigenda to: ``Pushdown machines for the macro tree transducer | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3773371 | 1986-01-01 | Paper |
| Iterated linear control and iterated one-turn pushdowns | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3732976 | 1986-01-01 | Paper |
| Macro tree transducers | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3692895 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738591 | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334094 | 1984-01-01 | Paper |
