| Publication | Date of Publication | Type |
|---|
A complete characterization of termination of 0p 1q→1r 0s
Rewriting Techniques and Applications | 2022-12-09 | Paper |
scientific article; zbMATH DE number 7559287 (Why is no real title available?)
(available as arXiv preprint) | 2022-07-18 | 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 |
Term Rewriting and Applications
Lecture Notes in Computer Science | 2005-11-11 | Paper |
Formal Techniques, Modelling and Analysis of Timed and Fault-Tolerant Systems
Lecture Notes in Computer Science | 2005-08-19 | Paper |
Theorem Proving in Higher Order Logics
Lecture Notes in Computer Science | 2005-08-18 | 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 |
| scientific article; zbMATH DE number 2090078 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2043544 (Why is no real title available?) | 2004-02-16 | 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 |
Decidability of termination of grid string rewriting rules
SIAM Journal on Computing | 2002-04-23 | 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 |
On normalizing, non-terminating one-rule string rewriting systems
Theoretical Computer Science | 2000-08-21 | Paper |
Parallelizing functional programs by generalization
Journal of Functional Programming | 2000-04-26 | 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 1179979 (Why is no real title available?) | 1998-07-28 | Paper |
| scientific article; zbMATH DE number 1086665 (Why is no real title available?) | 1998-04-01 | Paper |
| scientific article; zbMATH DE number 1088022 (Why is no real title available?) | 1997-11-17 | Paper |
Omega-termination is undecidable for totally terminating term rewriting systems
Journal of Symbolic Computation | 1997-05-28 | Paper |
An improved general path order
Applicable Algebra in Engineering, Communication and Computing | 1996-10-27 | Paper |
| scientific article; zbMATH DE number 4092748 (Why is no real title available?) | 1988-01-01 | Paper |
| scientific article; zbMATH DE number 3978367 (Why is no real title available?) | 1986-01-01 | Paper |
