| Publication | Date of Publication | Type |
|---|
scientific article; zbMATH DE number 7559287 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | Paper |
| Efficient completion of weighted automata | 2021-12-07 | Paper |
Efficient completion of weighted automata
(available as arXiv preprint) | 2021-12-07 | Paper |
| Matrix interpretations on polyhedral domains | 2017-07-12 | Paper |
| Compression of rewriting systems for termination analysis | 2017-02-01 | Paper |
Termination Competition (termCOMP 2015)
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
| Complexity analysis of term rewriting based on matrix and context dependent interpretations | 2012-10-19 | Paper |
| Polynomially bounded matrix interpretations | 2012-04-25 | Paper |
Joint spectral radius theory for automated complexity analysis of rewrite systems
Algebraic Informatics | 2011-07-08 | Paper |
| Max/Plus tree automata for termination of term rewriting | 2011-02-22 | Paper |
| Weighted automata define a hierarchy of terminating string rewriting systems | 2011-02-22 | Paper |
Local termination: theory and practice
Logical Methods in Computer Science | 2010-09-21 | Paper |
Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)
Information Processing Letters | 2010-01-18 | Paper |
Local Termination
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Automatic Termination
Rewriting Techniques and Applications | 2009-06-30 | Paper |
Matrix Interpretations for Proving Termination of Term Rewriting
Automated Reasoning | 2009-03-12 | Paper |
Termination of String Rewriting with Matrix Interpretations
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Arctic Termination ...Below Zero
Rewriting Techniques and Applications | 2008-08-28 | Paper |
| Weighted automata for proving termination of string rewriting | 2008-07-29 | Paper |
Matrix interpretations for proving termination of term rewriting
Journal of Automated Reasoning | 2008-06-11 | Paper |
Termination by Quasi-periodic Interpretations
Lecture Notes in Computer Science | 2008-01-02 | Paper |
Mathematical Foundations of Computer Science 2003
Lecture Notes in Computer Science | 2007-12-07 | Paper |
On tree automata that certify termination of left-linear term rewriting systems
Information and Computation | 2007-04-16 | Paper |
Termination proofs for string rewriting systems via inverse match-bounds
Journal of Automated Reasoning | 2006-11-17 | 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 |
Match-bounded string rewriting systems
Applicable Algebra in Engineering, Communication and Computing | 2005-02-09 | Paper |
Deleting string rewriting systems preserve regularity
Theoretical Computer Science | 2005-01-11 | Paper |
| scientific article; zbMATH DE number 2090070 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2087236 (Why is no real title available?) | 2004-08-11 | Paper |
| scientific article; zbMATH DE number 2040918 (Why is no real title available?) | 2004-02-11 | Paper |
The combinator S
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1216018 (Why is no real title available?) | 1998-10-27 | Paper |
| scientific article; zbMATH DE number 1189064 (Why is no real title available?) | 1998-10-11 | Paper |
