| Publication | Date of Publication | Type |
|---|
| Deciding the NTS property of context-free grammars | 2024-01-29 | Paper |
| Domino treewidth | 2024-01-05 | Paper |
| Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity | 2021-04-28 | Paper |
| Computability by monadic second-order logic | 2021-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3386623 | 2021-01-05 | Paper |
| XML navigation and transformation by tree-walking automata and transducers with visible and invisible pebbles | 2020-12-16 | Paper |
| A Greibach normal form for context-free graph grammars | 2019-12-04 | Paper |
| Corrigendum to: ``Iterated stack automata and complexity classes | 2019-05-29 | Paper |
| Concatenation of graphs | 2019-01-10 | Paper |
| Multiple context-free tree grammars: lexicalization and characterization | 2018-05-17 | Paper |
| Multiple context-free tree grammars and multi-component tree adjoining grammars | 2017-11-22 | Paper |
| Composition closure of linear extended top-down tree transducers | 2017-03-31 | Paper |
| Determinacy and rewriting of functional top-down and MSO tree transformations | 2016-12-28 | Paper |
| Context-Free Tree Grammars are as Powerful as Context-Free Jungle Grammars | 2016-05-03 | Paper |
| Erratum to: ``Top-down tree transducers with regular look-ahead | 2016-03-09 | Paper |
| Look-ahead removal for total deterministic top-down tree transducers | 2016-01-21 | Paper |
| The generative power of delegation networks | 2015-12-07 | Paper |
| Two-way pebble transducers for partial functions and their composition | 2015-10-29 | Paper |
| How to Remove the Look-Ahead of Top-Down Tree Transducers | 2014-10-14 | Paper |
| Tree transducers, L systems and two-way machines (Extended Abstract) | 2014-03-14 | Paper |
| Determinacy and Rewriting of Top-Down and MSO Tree Transformations | 2013-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3077955 | 2011-02-18 | Paper |
| The equivalence problem for deterministic MSO tree transducers is decidable | 2010-01-29 | Paper |
| An exercise in structural congruence | 2010-01-29 | Paper |
| A Kleene characterization of computability | 2010-01-29 | Paper |
| Extended multi bottom-up tree transducers | 2009-11-18 | Paper |
| Deciding equivalence of top-down XML transformations in polynomial time | 2009-06-08 | Paper |
| The time complexity of typechecking tree-walking tree transducers | 2009-04-27 | Paper |
| Extended Multi Bottom-Up Tree Transducers | 2008-10-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3504341 | 2008-06-11 | Paper |
| Nested Pebbles and Transitive Closure | 2008-03-19 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5431915 | 2008-01-02 | Paper |
| Automata with Nested Pebbles Capture First-Order Logic with Transitive Closure | 2007-10-11 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Clique-width for 4-vertex forbidden subgraphs | 2006-10-25 | Paper |
| Fundamentals of Computation Theory | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4662826 | 2005-03-30 | Paper |
| A new natural structural congruence in the pi-calculus with replication | 2004-12-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737910 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4738287 | 2004-08-11 | Paper |
| Branching synchronization grammars with nested tables | 2004-08-10 | Paper |
| A comparison of pebble tree transducers with macro tree transducers | 2004-03-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4452068 | 2004-02-11 | Paper |
| Macro Tree Translations of Linear Size Increase are MSO Definable | 2003-09-28 | Paper |
| MSO definable string transductions and two-way finite-state transducers | 2003-06-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708573 | 2003-06-18 | Paper |
| Derivation trees of ground term rewriting systems. | 2003-01-14 | Paper |
| Macro tree transducers, attribute grammars, and MSO definable tree translations. | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3150247 | 2002-12-10 | Paper |
| Decidability of the finiteness of ranges of tree transductions | 2002-11-24 | Paper |
| The equivalence of bottom-up and top-down tree-to-graph transducers | 2002-11-24 | Paper |
| Output string languages of compositions of deterministic macro tree transducers | 2002-08-04 | Paper |
| Structural inclusion in the pi-calculus with replication | 2001-08-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502802 | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4938634 | 2000-10-17 | Paper |
| A comparison of tree transductions defined by monadic second order logic and by attribute grammars | 2000-10-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501561 | 2000-09-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4954439 | 2000-06-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4941149 | 2000-02-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4269133 | 1999-10-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4247285 | 1999-06-16 | Paper |
| Axioms for generalized graphs, illustrated by a Cantor-Bernstein proposition | 1999-04-26 | Paper |
| Multisets and structural congruence of the pi-calculus with replication | 1999-01-12 | Paper |
| Context-free graph grammars and concatenation of graphs | 1998-10-01 | Paper |
| Logical description of context-free graph languages | 1998-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4386973 | 1998-05-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362731 | 1997-11-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3129299 | 1997-11-09 | Paper |
| Domino Treewidth | 1997-08-25 | Paper |
| Regular description of context-free graph languages | 1997-03-18 | Paper |
| Characterization and complexity of uniformly nonprimitive labeled 2-structures | 1997-02-28 | Paper |
| A multiset semantics for the pi-calculus with replication | 1997-02-28 | Paper |
| Finite languages for the representation of finite graphs | 1996-07-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4852905 | 1995-11-30 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4835901 | 1995-06-08 | Paper |
| The translation power of top-down tree-to-graph transducers | 1994-12-04 | Paper |
| Context-free graph languages of bounded degree are generated by apex graph grammars | 1994-11-23 | Paper |
| Hypergraph languages of bounded degree | 1994-03-27 | Paper |
| \(X\)-automata on \(\omega\)-words | 1993-08-30 | Paper |
| Handle-rewriting hypergraph grammars | 1993-06-29 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037292 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037313 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037316 | 1993-05-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4037317 | 1993-05-18 | Paper |
| An elementary proof of double Greibach normal form | 1993-05-16 | Paper |
| Context-free hypergraph grammars have the same term-generating power as attribute grammars | 1993-01-16 | Paper |
| Iterated stack automata and complexity classes | 1992-06-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3974863 | 1992-06-26 | Paper |
| A regular characterization of graph languages definable in monadic second-order logic | 1992-06-26 | Paper |
| Branching processes of Petri nets | 1992-06-25 | Paper |
| The string generating power of context-free hypergraph grammars | 1992-06-25 | Paper |
| The power of two-way deterministic checking stack automata | 1992-06-25 | Paper |
| Nonterminal separation in graph grammars | 1991-01-01 | Paper |
| Modular tree transducers | 1991-01-01 | Paper |
| The complexity of regular DNLC graph languages | 1990-01-01 | Paper |
| Boundary graph grammars with dynamic edge relabeling | 1990-01-01 | Paper |
| A comparison of boundary graph grammars and context-free hypergraph grammars | 1990-01-01 | Paper |
| Attribute storage optimization by stacks | 1990-01-01 | Paper |
| Complexity of boundary graph languages | 1990-01-01 | Paper |
| Linear graph grammars: Power and complexity | 1989-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3474898 | 1989-01-01 | Paper |
| Passes, sweeps, and visits in attribute grammars | 1989-01-01 | Paper |
| High level tree transducers and iterated pushdown tree transducers | 1988-01-01 | Paper |
| Apex graph grammars and attribute grammars | 1988-01-01 | Paper |
| Nonterminal bounded NLC graph grammars | 1988-01-01 | Paper |
| Prefix and equality languages of rational functions are co-context-free | 1988-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785994 | 1987-01-01 | Paper |
| Look-ahead on pushdowns | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3779767 | 1987-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3785993 | 1987-01-01 | Paper |
| Corrigenda to: ``Pushdown machines for the macro tree transducer | 1986-01-01 | Paper |
| Pushdown machines for the macro tree transducer | 1986-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3711773 | 1986-01-01 | Paper |
| The Complexity of Languages Generated by Attribute Grammars | 1986-01-01 | Paper |
| Hierarchies of hyper-AFLs | 1985-01-01 | Paper |
| Determinacy \(\to\) (observation equivalence \(=\) trace equivalence) | 1985-01-01 | Paper |
| Macro tree transducers | 1985-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3738591 | 1985-01-01 | Paper |
| Extended macro grammars and stack controlled machines | 1984-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3334094 | 1984-01-01 | Paper |
| Context free normal systems and ETOL systems | 1983-01-01 | Paper |
| A note on non-generators of full afl's | 1982-01-01 | Paper |
| Three hierarchies of transducers | 1982-01-01 | Paper |
| Simple multi-visit attribute grammars | 1982-01-01 | Paper |
| The copying power of one-state tree transducers | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3326871 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3917507 | 1981-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919105 | 1981-01-01 | Paper |
| Passes and paths of attribute grammars | 1981-01-01 | Paper |
| A translational theorem for the class of EOL languages | 1981-01-01 | Paper |
| The formal power of one-visit attribute grammars | 1981-01-01 | Paper |
| Stack Machines and Classes of Nonnested Macro Languages | 1980-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3890134 | 1980-01-01 | Paper |
| Fixed Point Languages, Equality Languages, and Representation of Recursively Enumerable Languages | 1980-01-01 | Paper |
| Tree transducers, L systems, and two-way machines | 1980-01-01 | Paper |
| Equality languages and fixed point languages | 1979-01-01 | Paper |
| Bounded nesting in macro grammars | 1979-01-01 | Paper |
| Extended linear macro grammars, iteration grammars, and register programs | 1979-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4167602 | 1978-01-01 | Paper |
| Iterating iterated substitution | 1978-01-01 | Paper |
| IO and OI. II | 1978-01-01 | Paper |
| On tree transducers for partial functions | 1978-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4138163 | 1977-01-01 | Paper |
| Top-down tree transducers with regular look-ahead | 1977-01-01 | Paper |
| Iterated deterministic-substitution | 1977-01-01 | Paper |
| IO and OI. I | 1977-01-01 | Paper |
| Copying theorems | 1976-01-01 | Paper |
| Surface tree languages and parallel derivation trees | 1976-01-01 | Paper |
| Bottom-up and top-down tree transformations— a comparison | 1975-01-01 | Paper |
| Simple program schemes and formal languages | 1974-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5680989 | 1973-01-01 | Paper |
| A note on infinite trees | 1972-01-01 | Paper |
