| Publication | Date of Publication | Type |
|---|
| The Component Hierarchy of Chain-Free Cooperating Distributed Regular Tree Grammars Revisited | 2023-08-16 | Paper |
| Bottom-up tree pushdown automata and rewrite systems | 2022-12-09 | Paper |
| Deterministic top-down tree automata with Boolean deterministic look-ahead | 2022-08-10 | Paper |
| Some decidability results on one-pass reductions | 2019-06-20 | Paper |
| Descendants of a recognizable tree language for prefix constrained linear monadic term rewriting with position cutting strategy | 2018-06-07 | Paper |
| Intersection of the reflexive transitive closures of two rewrite relations induced by term rewriting systems | 2018-04-04 | Paper |
| Minimization of Deterministic Top-down Tree Automata | 2017-08-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5507087 | 2016-12-16 | Paper |
| One-pass reductions | 2016-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5740432 | 2016-07-26 | Paper |
| On ground word problem of term equation systems | 2016-05-03 | Paper |
| Symbol different term rewrite systems | 2015-08-21 | Paper |
| Tree shuffle | 2014-01-22 | Paper |
| Rewriting preserving recognizability of finite tree languages | 2013-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4904142 | 2013-01-28 | Paper |
| CHAP and rewrite components | 2012-03-23 | Paper |
| Murg term rewrite systems | 2010-06-09 | Paper |
| Congruences Generated by Extended Ground Term Rewrite Systems | 2010-02-05 | Paper |
| Descendants of a recognizable tree language for sets of linear monadic term rewrite rules | 2010-01-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3655368 | 2010-01-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3395997 | 2009-09-15 | Paper |
| Deterministic bottom-up tree transducers and ground term rewrite systems | 2009-05-28 | Paper |
| Losing recognizability | 2007-07-16 | Paper |
| SHUFFLE DECOMPOSITIONS OF REGULAR LANGUAGES | 2005-06-22 | Paper |
| Storage-to-tree transducers with look-ahead | 2005-02-09 | Paper |
| Right-linear half-monadic term rewrite systems | 2004-10-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737906 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4431392 | 2003-10-21 | Paper |
| On ground tree transformations and congruences induced by tree automata. | 2003-08-17 | Paper |
| Term rewriting restricted to ground terms. | 2003-08-17 | Paper |
| Intersection of finitely generated congruences over term algebra | 2003-07-30 | Paper |
| The ground tree transducer game with identical tree automata | 2001-12-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4503832 | 2001-09-04 | Paper |
| Restricted ground tree transducers | 2000-12-12 | Paper |
| Congruential complements of ground term rewrite systems | 2000-08-21 | Paper |
| A property of left-linear rewrite systems preserving recognizability | 2000-08-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269134 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4264118 | 1999-09-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3842797 | 1998-08-20 | Paper |
| Linear generalized semi-monadic rewrite systems effectively preserve recognizability | 1998-08-13 | Paper |
| Deterministic top-down tree transducers with iterated look-ahead | 1997-02-28 | Paper |
| Compositions of deterministic bottom-up, top-down, and regular look-ahead tree transformations | 1997-02-27 | Paper |
| A hierarchy of deterministic top-down tree transformations | 1996-06-27 | Paper |
| Attributed tree transducers cannot induce all deterministic bottom-up tree transformations | 1995-12-19 | Paper |
| Minimal equational representations of recognizable tree languages | 1995-11-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4273673 | 1994-07-28 | Paper |
| Bottom-up tree pushdown automata: Classification and connection with rewrite systems | 1994-05-15 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4284265 | 1994-04-17 | Paper |
| A fast algorithm for constructing a tree automaton recognizing a congruential tree language | 1993-10-03 | Paper |
| Tree transducers with external functions | 1993-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4005178 | 1992-09-27 | Paper |
| Top-down tree transducers with two-way tree walking look-ahead | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974865 | 1992-06-26 | Paper |
| A complete classification of deterministic root-to-frontier tree transformation classes | 1991-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3485880 | 1990-01-01 | Paper |
| A complete rewriting system for a monoid of tree transformation classes | 1990-01-01 | Paper |
| The emptiness problem is undecidable for domains of partial monadic 2- modular tree transformations | 1990-01-01 | Paper |
| Top-down tree transducers with deterministic top-down look-ahead | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3468622 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3490951 | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3832055 | 1988-01-01 | Paper |
| Variants of top-down tree transducers with look-ahead | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3028362 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779776 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3813315 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3026371 | 1986-01-01 | Paper |
