| Publication | Date of Publication | Type |
|---|
| Correspondence between composite theories and distributive laws | 2025-01-20 | Paper |
| From linear term rewriting to graph rewriting with preservation of termination | 2024-12-06 | Paper |
| Confluence of the Chinese Monoid | 2024-03-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6121514 | 2024-02-27 | Paper |
| Termination of graph transformation systems using weighted subgraph counting | 2024-01-12 | Paper |
| Fuzzy presheaves are quasitoposes | 2024-01-12 | Paper |
| Graph rewriting and relabeling with PBPO\(^+\): a unifying theory for quasitoposes | 2023-06-19 | Paper |
| Algebraic presentation of semifree monads | 2022-12-07 | Paper |
| Patch Graph Rewriting | 2022-09-01 | Paper |
| Algebraic Presentation of Semifree Monads | 2022-05-11 | Paper |
| Graph rewriting and relabeling with PBPO\textsuperscript{+} | 2022-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5009706 | 2021-08-05 | Paper |
| Decreasing diagrams with two labels are complete for confluence of countable systems | 2021-06-15 | Paper |
| Transducer degrees: atoms, infima and suprema | 2020-05-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5109511 | 2020-05-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5224689 | 2019-07-24 | Paper |
| Braids via term rewriting | 2019-06-18 | Paper |
| Syllogistic logic with “Most” | 2019-05-27 | Paper |
| Degrees of Infinite Words, Polynomials and Atoms | 2018-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4584900 | 2018-09-04 | Paper |
| Regularity Preserving but Not Reflecting Encodings | 2018-04-23 | Paper |
| On periodically iterated morphisms | 2018-04-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4600775 | 2018-01-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5277876 | 2017-07-12 | Paper |
| Proving non-termination by finite automata | 2017-07-12 | Paper |
| Clocked lambda calculus | 2017-06-14 | Paper |
| Automatic Sequences and Zip-Specifications | 2017-05-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2957694 | 2017-01-27 | Paper |
| Degrees of Infinite Words, Polynomials and Atoms | 2016-08-30 | Paper |
| Majority digraphs | 2016-06-22 | Paper |
| Degrees of Transducibility | 2015-11-04 | Paper |
| The Degree of Squares is an Atom | 2015-11-04 | Paper |
| Syllogistic Logic with “Most” | 2015-09-24 | Paper |
| Eigenvalues and Transduction of Morphic Sequences | 2014-10-14 | Paper |
| De Bruijn's weak diamond property revisited | 2014-09-03 | Paper |
| On the complexity of stream equality | 2014-08-14 | Paper |
| On the complexity of equivalence of specifications of infinite objects | 2014-07-21 | Paper |
| Discriminating Lambda-Terms Using Clocked Boehm Trees | 2014-06-10 | Paper |
| Infinitary Term Rewriting for Weakly Orthogonal Systems: Properties and Counterexamples | 2014-06-10 | Paper |
| Clocks for Functional Programs | 2014-04-16 | Paper |
| Degrees of streams | 2013-10-25 | Paper |
| Circular Coinduction in Coq Using Bisimulation-Up-To Techniques | 2013-08-07 | Paper |
| Fast leader election in anonymous rings with bounded expected delay | 2013-04-04 | Paper |
| Mix-Automatic Sequences | 2013-03-18 | Paper |
| Highlights in infinitary rewriting and lambda calculus | 2013-01-07 | Paper |
| Unique Normal Forms in Infinitary Weakly Orthogonal Rewriting | 2012-04-25 | Paper |
| Proving equality of streams automatically | 2012-04-24 | Paper |
| Arithmetic Self-Similarity of Infinite Sequences | 2012-01-18 | Paper |
| On equal \(\mu \)-terms | 2011-07-07 | Paper |
| Lazy productivity via termination | 2011-07-07 | Paper |
| Levels of undecidability in rewriting | 2011-02-21 | Paper |
| Local termination: theory and practice | 2010-09-21 | Paper |
| Transforming Outermost into Context-Sensitive Rewriting | 2010-07-27 | Paper |
| Productivity of stream definitions | 2010-02-09 | Paper |
| Degrees of Undecidability in Term Rewriting | 2009-11-12 | Paper |
| Complexity of Fractran and Productivity | 2009-07-28 | Paper |
| Proving Infinitary Normalization | 2009-07-02 | Paper |
| Local Termination | 2009-06-30 | Paper |
| From Outermost to Context-Sensitive Rewriting | 2009-06-30 | Paper |
| Matrix Interpretations for Proving Termination of Term Rewriting | 2009-03-12 | Paper |
| Data-Oblivious Stream Productivity | 2009-01-27 | Paper |
| Reduction Under Substitution | 2008-08-28 | Paper |
| Matrix interpretations for proving termination of term rewriting | 2008-06-11 | Paper |
| Productivity of Stream Definitions | 2008-02-26 | Paper |
| Correspondence between Composite Theories and Distributive Laws | N/A | Paper |
