| Publication | Date of Publication | Type |
|---|
| Passive automata learning: DFAs and NFAs | 2023-07-26 | Paper |
| Type removal in term rewriting | 2023-03-09 | Paper |
| Termination of term rewriting by interpretation | 2023-03-09 | Paper |
| Total termination of term rewriting | 2022-12-09 | Paper |
| A complete characterization of termination of 0p 1q→1r 0s | 2022-12-09 | Paper |
| Rewrite systems for integer arithmetic | 2022-12-09 | Paper |
| Dummy elimination: Making termination easier | 2022-12-09 | Paper |
| Complexity of automatic sequences | 2022-10-13 | Paper |
| Deadlock in packet switching networks | 2022-06-17 | Paper |
| Slowly synchronizing automata with fixed alphabet size | 2021-07-21 | Paper |
| Complexity of automatic sequences | 2020-07-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5111908 | 2020-05-27 | Paper |
| Simple termination revisited | 2020-01-21 | Paper |
| Counting symbol switches in synchronizing automata | 2020-01-15 | Paper |
| On the interrelation between synchronized and non-synchronized behaviour of Petri Nets | 2019-10-14 | Paper |
| Lower Bounds for Synchronizing Word Lengths in Partial Automata | 2019-06-24 | Paper |
| Solving computational problems in the theory of word-representable graphs | 2019-03-04 | Paper |
| Synchronizing non-deterministic finite automata | 2019-02-18 | Paper |
| RNA-Editing with Combined Insertion and Deletion Preserves Regularity | 2019-02-08 | Paper |
| Transforming termination by self-labelling | 2019-01-15 | Paper |
| Finding small counterexamples for abstract rewriting properties | 2018-09-05 | Paper |
| Termination of context-sensitive rewriting | 2017-11-17 | Paper |
| DFAs and PFAs with long shortest synchronizing word length | 2017-10-13 | Paper |
| Classifying non-periodic sequences by permutation transducers | 2017-10-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5277877 | 2017-07-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5277885 | 2017-07-12 | Paper |
| Finding DFAs with Maximal Shortest Synchronizing Word Length | 2017-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2980975 | 2017-05-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2970215 | 2017-03-29 | Paper |
| Ordering sequences by permutation transducers | 2017-01-18 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2818569 | 2016-09-07 | Paper |
| TURTLE GRAPHICS OF MORPHIC SEQUENCES | 2016-07-05 | Paper |
| A Probabilistic Analysis of the Game of the Goose | 2016-05-20 | Paper |
| Using SMT for Solving Fragments of Parameterised Boolean Equation Systems | 2016-01-08 | Paper |
| The Degree of Squares is an Atom | 2015-11-04 | Paper |
| Proving Termination of Graph Transformation Systems Using Weighted Type Graphs over Semirings | 2015-09-22 | Paper |
| FINDING SMALL EQUIVALENT DECISION TREES IS HARD | 2015-04-29 | Paper |
| Termination Analysis for Graph Transformation Systems | 2014-09-15 | Paper |
| Termination of Cycle Rewriting | 2014-07-24 | Paper |
| A Transformational Approach to Prove Outermost Termination Automatically | 2014-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2844067 | 2013-08-27 | Paper |
| Transforming equality logic to propositional logic | 2013-04-19 | Paper |
| A Rewriting View of Simple Typing | 2013-04-09 | Paper |
| Cinderella versus the Wicked Stepmother | 2012-09-21 | Paper |
| A Tool Proving Well-Definedness of Streams Using Termination Tools | 2012-06-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389158 | 2012-04-25 | Paper |
| https://portal.mardi4nfdi.de/entity/Q5389096 | 2012-04-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3006476 | 2011-06-14 | Paper |
| Levels of undecidability in rewriting | 2011-02-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3075128 | 2011-02-10 | Paper |
| Well-definedness of Streams by Transformation and Termination | 2010-09-21 | Paper |
| Complexity of Guided Insertion-Deletion in RNA-Editing | 2010-05-26 | Paper |
| Degrees of Undecidability in Term Rewriting | 2009-11-12 | Paper |
| Well-Definedness of Streams by Termination | 2009-06-30 | Paper |
| LATIN 2004: Theoretical Informatics | 2009-05-07 | Paper |
| Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems | 2009-03-12 | Paper |
| Matrix Interpretations for Proving Termination of Term Rewriting | 2009-03-12 | Paper |
| Adding constants to string rewriting | 2008-09-10 | Paper |
| Normalization of Infinite Terms | 2008-08-28 | Paper |
| Matrix interpretations for proving termination of term rewriting | 2008-06-11 | Paper |
| Certification of Proving Termination of Term Rewriting by Matrix Interpretations | 2008-03-07 | Paper |
| Termination by Quasi-periodic Interpretations | 2008-01-02 | Paper |
| Generalizing DPLL and satisfiability for equalities | 2007-08-23 | Paper |
| On tree automata that certify termination of left-linear term rewriting systems | 2007-04-16 | Paper |
| Processes, Terms and Cycles: Steps on the Road to Infinity | 2006-11-13 | Paper |
| Termination of string rewriting proved automatically | 2006-11-03 | Paper |
| Frontiers of Combining Systems | 2006-10-10 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Term Rewriting and Applications | 2005-11-11 | Paper |
| Implementation and Application of Automata | 2005-08-17 | Paper |
| FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS | 2005-08-01 | Paper |
| SIZES OF ORDERED DECISION TREES | 2005-06-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3043797 | 2004-08-06 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447242 | 2004-02-16 | Paper |
| Resolution and binary decision diagrams cannot simulate each other polynomially | 2003-09-15 | Paper |
| Relative undecidability in term rewriting. I: The termination hierarchy | 2003-01-14 | Paper |
| Relative undecidability in term rewriting. II: The confluence hierarchy | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4536397 | 2002-10-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4537515 | 2002-07-01 | Paper |
| A rewriting approach to binary decision diagrams | 2002-05-21 | Paper |
| The termination hierarchy for term rewriting | 2001-08-26 | Paper |
| A complete characterization of termination of \(0^p1^q\to 1^r0^s\) | 2000-10-30 | Paper |
| Non-Looping String Rewriting | 2000-01-04 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4705617 | 1999-12-20 | Paper |
| Termination modulo equations by abstract commutation with an application to iteration | 1998-07-23 | Paper |
| Simple termination of rewrite systems | 1998-07-23 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4362915 | 1998-04-01 | Paper |
| Total termination of term rewriting is undecidable | 1996-08-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4847000 | 1996-06-25 | Paper |
| Total termination of term rewriting | 1996-05-14 | Paper |
| Termination of term rewriting: Interpretation and type elimination | 1994-10-10 | Paper |
| Longest segment problems | 1992-09-27 | Paper |
| Minimizing sums of addition chains | 1991-01-01 | Paper |
| A computation concerning doubly transitive permutation groups. | 1984-01-01 | Paper |
| Global restrictions on ramification in number fields | 1983-01-01 | Paper |
| Integer valued polynomials over a number field | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4745901 | 1982-01-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3919789 | 1980-01-01 | Paper |
