| Publication | Date of Publication | Type |
|---|
| Attributed tree transducers for partial functions | 2025-01-20 | Paper |
| Checking in polynomial time whether or not a regular tree language is deterministic top-down | 2024-03-26 | Paper |
| Deciding whether an attributed translation can be realized by a top-down transducer | 2024-02-28 | Paper |
| Functionality of compositions of top-down tree transducers is decidable | 2024-01-18 | Paper |
| Definability Results for Top-Down Tree Transducers | 2023-08-15 | Paper |
| How to decide functionality of compositions of top-down tree transducers | 2023-07-26 | Paper |
| Deciding origin equivalence of weakly self-nesting macro tree transducers | 2023-01-30 | Paper |
| Deciding top-down determinism of regular tree languages | 2022-05-20 | Paper |
| Definability results for top-down tree transducers | 2022-03-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994936 | 2021-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4994134 | 2021-06-17 | Paper |
| Linear-bounded composition of tree-walking tree transducers: linear size increase and complexity | 2021-04-28 | Paper |
| Largest common prefix of a regular tree language | 2020-10-23 | Paper |
| Constant delay traversal of grammar-compressed graphs with bounded rank | 2020-07-13 | Paper |
| Static garbage collection | 2020-05-06 | Paper |
| Grammar-based compression of unranked trees | 2020-02-27 | Paper |
| Largest common prefix of a regular tree language | 2020-01-30 | Paper |
| Deciding equivalence of separated non-nested attribute systems in polynomial time | 2020-01-28 | Paper |
| Equivalence of Deterministic Top-Down Tree-to-String Transducers Is Decidable | 2018-12-06 | Paper |
| Grammar-based compression of unranked trees | 2018-11-28 | Paper |
| Constant-time tree traversal and subtree equality check for grammar-compressed trees | 2018-07-25 | Paper |
| Compression of Unordered XML Trees | 2018-07-18 | Paper |
| Decision problems of tree transducers with origin | 2018-06-14 | Paper |
| Multiple context-free tree grammars: lexicalization and characterization | 2018-05-17 | Paper |
| Balancedness of MSO transductions in polynomial time | 2018-03-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4599222 | 2017-12-18 | Paper |
| Efficient testing and matching of deterministic regular expressions | 2017-09-07 | Paper |
| A strict border for the decidability of E-unification for recursive functions | 2017-01-19 | Paper |
| Determinacy and rewriting of functional top-down and MSO tree transformations | 2016-12-28 | Paper |
| Domains of partial attributed tree transducers | 2016-06-16 | Paper |
| XML compression via directed acyclic graphs | 2016-04-18 | Paper |
| Look-ahead removal for total deterministic top-down tree transducers | 2016-01-21 | Paper |
| Decision Problems of Tree Transducers with Origin | 2015-11-04 | Paper |
| Compressed Tree Canonization | 2015-11-04 | Paper |
| How to Remove the Look-Ahead of Top-Down Tree Transducers | 2014-10-14 | Paper |
| Determinacy and Rewriting of Top-Down and MSO Tree Transformations | 2013-09-20 | Paper |
| Type Checking of Tree Walking Transducers | 2013-02-26 | Paper |
| The Complexity of Tree Transducer Output Languages | 2012-10-19 | Paper |
| Earliest normal form and minimization for bottom-up tree transducers | 2012-08-29 | Paper |
| Parameter reduction and automata evaluation for grammar-compressed trees | 2012-08-17 | Paper |
| First-Order Unification on Compressed Terms | 2012-04-24 | Paper |
| Deciding Regularity of the Set of Instances of a Set of Terms with Regular Constraints is EXPTIME-Complete | 2011-07-29 | Paper |
| Minimization of Deterministic Bottom-Up Tree Transducers | 2010-08-31 | Paper |
| The equivalence problem for deterministic MSO tree transducers is decidable | 2010-01-29 | Paper |
| FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science | 2009-08-06 | Paper |
| Deciding equivalence of top-down XML transformations in polynomial time | 2009-06-08 | Paper |
| Parameter Reduction in Grammar-Compressed Trees | 2009-03-31 | Paper |
| Multi-Return Macro Tree Transducers | 2009-02-12 | Paper |
| Classes of Tree Homomorphisms with Decidable Preservation of Regularity | 2008-04-11 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| The complexity of tree automata and XPath on grammar-compressed trees | 2007-01-09 | Paper |
| FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science | 2006-11-14 | Paper |
| Implementation and Application of Automata | 2006-11-13 | Paper |
| Database Programming Languages | 2006-10-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4737910 | 2004-08-11 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4473157 | 2004-08-04 | Paper |
| A comparison of pebble tree transducers with macro tree transducers | 2004-03-11 | Paper |
| Macro Tree Translations of Linear Size Increase are MSO Definable | 2003-09-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4415261 | 2003-07-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4708573 | 2003-06-18 | Paper |
| A formal model for an expressive fragment of XSLT | 2003-02-02 | Paper |
| Macro tree transducers, attribute grammars, and MSO definable tree translations. | 2003-01-14 | Paper |
| Output string languages of compositions of deterministic macro tree transducers | 2002-08-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2767135 | 2002-01-28 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4502802 | 2000-11-07 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4939196 | 2000-10-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4501561 | 2000-09-04 | Paper |
| The generating power of total deterministic tree transducers | 1999-12-19 | Paper |
| Cooperating distributed hyperedge replacement grammars | 1999-11-10 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259969 | 1999-09-09 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4260711 | 1999-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4236234 | 1999-03-22 | Paper |
