| Publication | Date of Publication | Type |
|---|
The paint pot problem and common multiples in monoids
Applicable Algebra in Engineering, Communication and Computing | 2025-02-18 | Paper |
| Characterizing morphic sequences | 2025-02-07 | Paper |
Playing with infinity. Turtles, patterns, and pictures
AK Peters/CRC Recreational Mathematics Series | 2024-06-28 | Paper |
Passive automata learning: DFAs and NFAs
Lecture Notes in Computer Science | 2023-07-26 | Paper |
Termination of term rewriting by interpretation
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
Type removal in term rewriting
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
A complete characterization of termination of 0p 1q→1r 0s
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Total termination of term rewriting
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Dummy elimination: Making termination easier
Fundamentals of Computation Theory | 2022-12-09 | Paper |
Rewrite systems for integer arithmetic
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Complexity of automatic sequences
Information and Computation | 2022-10-13 | Paper |
Deadlock in packet switching networks
(available as arXiv preprint) | 2022-06-17 | Paper |
Slowly synchronizing automata with fixed alphabet size
Information and Computation | 2021-07-21 | Paper |
Complexity of automatic sequences
Language and Automata Theory and Applications | 2020-07-27 | Paper |
| Triangulation in rewriting | 2020-05-27 | Paper |
Simple termination revisited
Automated Deduction — CADE-12 | 2020-01-21 | Paper |
Counting symbol switching in synchronizing automata
(available as arXiv preprint) | 2020-01-15 | Paper |
The \(k\)-dimensional cube is \(k\)-representable
(available as arXiv preprint) | 2019-10-14 | Paper |
Lower bounds for synchronizing word lengths in partial automata
International Journal of Foundations of Computer Science | 2019-06-24 | Paper |
Solving computational problems in the theory of word-representable graphs
(available as arXiv preprint) | 2019-03-04 | Paper |
| Solving computational problems in the theory of word-representable graphs | 2019-03-04 | Paper |
Synchronizing non-deterministic finite automata
(available as arXiv preprint) | 2019-02-18 | Paper |
RNA-editing with combined insertion and deletion preserves regularity
Scientific Annals of Computer Science | 2019-02-08 | Paper |
Transforming termination by self-labelling
Automated Deduction — Cade-13 | 2019-01-15 | Paper |
Finding small counterexamples for abstract rewriting properties
Mathematical Structures in Computer Science | 2018-09-05 | Paper |
Termination of context-sensitive rewriting
Rewriting Techniques and Applications | 2017-11-17 | Paper |
DFAs and PFAs with long shortest synchronizing word length
(available as arXiv preprint) | 2017-10-13 | Paper |
| Classifying non-periodic sequences by permutation transducers | 2017-10-13 | Paper |
Proving non-termination by finite automata
(available as arXiv preprint) | 2017-07-12 | Paper |
| Transforming cycle rewriting into string rewriting | 2017-07-12 | Paper |
Finding DFAs with maximal shortest synchronizing word length
Language and Automata Theory and Applications | 2017-06-01 | Paper |
Termination of cycle rewriting by transformation and matrix interpretation
(available as arXiv preprint) | 2017-05-08 | Paper |
| Liveness verification in TRSs using tree automata and termination analysis | 2017-03-29 | Paper |
Ordering sequences by permutation transducers
Indagationes Mathematicae. New Series | 2017-01-18 | Paper |
The chance to win the Game of the Goose
Nieuw Archief voor Wiskunde. Vijfde Serie | 2016-09-07 | Paper |
Turtle graphics of morphic sequences
Fractals | 2016-07-05 | Paper |
A probabilistic analysis of the Game of the Goose
SIAM Review | 2016-05-20 | Paper |
Using SMT for solving fragments of parameterised Boolean equation systems
Automated Technology for Verification and Analysis | 2016-01-08 | Paper |
The degree of squares is an atom
Lecture Notes in Computer Science | 2015-11-04 | Paper |
The degree of squares is an atom
Lecture Notes in Computer Science | 2015-11-04 | Paper |
Proving termination of graph transformation systems using weighted type graphs over semirings
Graph Transformation | 2015-09-22 | Paper |
Finding small equivalent decision trees is hard
International Journal of Foundations of Computer Science | 2015-04-29 | Paper |
Termination analysis for graph transformation systems
Advanced Information Systems Engineering | 2014-09-15 | Paper |
Termination of cycle rewriting
Lecture Notes in Computer Science | 2014-07-24 | Paper |
A Transformational Approach to Prove Outermost Termination Automatically
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
| Simulating liveness by reduction strategies | 2013-08-27 | Paper |
Transforming equality logic to propositional logic
Electronic Notes in Theoretical Computer Science | 2013-04-19 | Paper |
A rewriting view of simple typing
Logical Methods in Computer Science | 2013-04-09 | Paper |
Cinderella versus the wicked stepmother
Lecture Notes in Computer Science | 2012-09-21 | Paper |
A tool proving well-definedness of streams using termination tools
Algebra and Coalgebra in Computer Science | 2012-06-01 | Paper |
| PROVING PRODUCTIVITY IN INFINITE DATA STRUCTURES | 2012-04-25 | Paper |
| Proving equality of streams automatically | 2012-04-24 | Paper |
| Ordered binary decision diagrams, pigeonhole formulas and beyond | 2011-06-14 | Paper |
Levels of undecidability in rewriting
Information and Computation | 2011-02-21 | Paper |
| scientific article; zbMATH DE number 5850005 (Why is no real title available?) | 2011-02-10 | Paper |
Well-definedness of streams by transformation and termination
Logical Methods in Computer Science | 2010-09-21 | Paper |
Complexity of guided insertion-deletion in RNA-editing
Language and Automata Theory and Applications | 2010-05-26 | Paper |
Degrees of Undecidability in Term Rewriting
Computer Science Logic | 2009-11-12 | Paper |
Well-Definedness of Streams by Termination
Rewriting Techniques and Applications | 2009-06-30 | Paper |
LATIN 2004: Theoretical Informatics
Lecture Notes in Computer Science | 2009-05-07 | Paper |
Matrix Interpretations for Proving Termination of Term Rewriting
Automated Reasoning | 2009-03-12 | Paper |
Automation of Recursive Path Ordering for Infinite Labelled Rewrite Systems
Automated Reasoning | 2009-03-12 | Paper |
Adding constants to string rewriting
Applicable Algebra in Engineering, Communication and Computing | 2008-09-10 | Paper |
Normalization of Infinite Terms
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Matrix interpretations for proving termination of term rewriting
Journal of Automated Reasoning | 2008-06-11 | Paper |
Certification of Proving Termination of Term Rewriting by Matrix Interpretations
SOFSEM 2008: Theory and Practice of Computer Science | 2008-03-07 | Paper |
Termination by Quasi-periodic Interpretations
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Generalizing DPLL and satisfiability for equalities
Information and Computation | 2007-08-23 | Paper |
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation | 2007-04-16 | Paper |
Processes, Terms and Cycles: Steps on the Road to Infinity
Lecture Notes in Computer Science | 2006-11-13 | Paper |
Termination of string rewriting proved automatically
Journal of Automated Reasoning | 2006-11-03 | Paper |
Frontiers of Combining Systems
Lecture Notes in Computer Science | 2006-10-10 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Implementation and Application of Automata
Lecture Notes in Computer Science | 2005-08-17 | Paper |
FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS
International Journal of Foundations of Computer Science | 2005-08-01 | Paper |
SIZES OF ORDERED DECISION TREES
International Journal of Foundations of Computer Science | 2005-06-22 | Paper |
| scientific article; zbMATH DE number 2084326 (Why is no real title available?) | 2004-08-06 | Paper |
| scientific article; zbMATH DE number 2043538 (Why is no real title available?) | 2004-02-16 | Paper |
Resolution and binary decision diagrams cannot simulate each other polynomially
Discrete Applied Mathematics | 2003-09-15 | Paper |
Relative undecidability in term rewriting. I: The termination hierarchy
Information and Computation | 2003-01-14 | Paper |
Relative undecidability in term rewriting. II: The confluence hierarchy
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1759447 (Why is no real title available?) | 2002-10-08 | Paper |
| scientific article; zbMATH DE number 1761896 (Why is no real title available?) | 2002-07-01 | Paper |
A rewriting approach to binary decision diagrams
The Journal of Logic and Algebraic Programming | 2002-05-21 | Paper |
The termination hierarchy for term rewriting
Applicable Algebra in Engineering, Communication and Computing | 2001-08-26 | Paper |
A complete characterization of termination of \(0^p1^q\to 1^r0^s\)
Applicable Algebra in Engineering, Communication and Computing | 2000-10-30 | Paper |
Non-Looping String Rewriting
RAIRO - Theoretical Informatics and Applications | 2000-01-04 | Paper |
Non-Looping String Rewriting
RAIRO - Theoretical Informatics and Applications | 2000-01-04 | Paper |
| scientific article; zbMATH DE number 1380897 (Why is no real title available?) | 1999-12-20 | Paper |
Termination modulo equations by abstract commutation with an application to iteration
Theoretical Computer Science | 1998-07-23 | Paper |
Simple termination of rewrite systems
Theoretical Computer Science | 1998-07-23 | Paper |
| scientific article; zbMATH DE number 1086665 (Why is no real title available?) | 1998-04-01 | Paper |
Total termination of term rewriting is undecidable
Journal of Symbolic Computation | 1996-08-13 | Paper |
| scientific article; zbMATH DE number 794240 (Why is no real title available?) | 1996-06-25 | Paper |
Total termination of term rewriting
Applicable Algebra in Engineering, Communication and Computing | 1996-05-14 | Paper |
Termination of term rewriting: Interpretation and type elimination
Journal of Symbolic Computation | 1994-10-10 | Paper |
Longest segment problems
Science of Computer Programming | 1992-09-27 | Paper |
Minimizing sums of addition chains
Journal of Algorithms | 1991-01-01 | Paper |
A computation concerning doubly transitive permutation groups.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1984-01-01 | Paper |
A computation concerning doubly transitive permutation groups.
Journal für die reine und angewandte Mathematik (Crelles Journal) | 1984-01-01 | Paper |
Global restrictions on ramification in number fields
Manuscripta Mathematica | 1983-01-01 | Paper |
| scientific article; zbMATH DE number 3801654 (Why is no real title available?) | 1982-01-01 | Paper |
Integer valued polynomials over a number field
Manuscripta Mathematica | 1982-01-01 | Paper |
| scientific article; zbMATH DE number 3732176 (Why is no real title available?) | 1980-01-01 | Paper |
