| Publication | Date of Publication | Type |
|---|
Computing linearizations using test sets
Conditional Term Rewriting Systems | 2023-03-09 | Paper |
Termination proofs and the length of derivations
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Time bounded rewrite systems and termination proofs by generalized embedding
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Algebraic and Logic Programming | 2022-08-16 | Paper |
Sparse tiling through overlap closures for termination of string rewriting
(available as arXiv preprint) | 2022-07-18 | Paper |
Finding and certifying loops
SOFSEM 2010: Theory and Practice of Computer Science | 2010-01-28 | Paper |
Termination of \(\{aa\rightarrow bc,bb\rightarrow ac,cc\rightarrow ab\}\)
Information Processing Letters | 2010-01-18 | Paper |
Termination of String Rewriting with Matrix Interpretations
Lecture Notes in Computer Science | 2008-09-25 | 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 |
On state-alternating context-free grammars
Theoretical Computer Science | 2005-06-30 | 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 2040918 (Why is no real title available?) | 2004-02-11 | Paper |
An upper bound on the derivational complexity of Knuth-Bendix orderings.
Information and Computation | 2003-08-19 | Paper |
| scientific article; zbMATH DE number 1860714 (Why is no real title available?) | 2003-05-22 | Paper |
| scientific article; zbMATH DE number 1722702 (Why is no real title available?) | 2002-03-21 | Paper |
Test sets for the universal and existential closure of regular tree languages.
Information and Computation | 2002-01-01 | Paper |
Termination proofs for ground rewrite systems -- interpretations and derivational complexity
Applicable Algebra in Engineering, Communication and Computing | 2001-08-26 | Paper |
| scientific article; zbMATH DE number 1523042 (Why is no real title available?) | 2001-05-28 | Paper |
| scientific article; zbMATH DE number 1456959 (Why is no real title available?) | 2000-06-07 | Paper |
| scientific article; zbMATH DE number 1405628 (Why is no real title available?) | 2000-02-23 | Paper |
Linearizing term rewriting systems using test sets
Journal of Symbolic Computation | 1994-09-12 | Paper |
| scientific article; zbMATH DE number 195157 (Why is no real title available?) | 1993-06-05 | Paper |
| scientific article; zbMATH DE number 107873 (Why is no real title available?) | 1993-01-23 | Paper |
Termination proofs by multiset path orderings imply primitive recursive derivation lengths
Theoretical Computer Science | 1993-01-16 | Paper |
| scientific article; zbMATH DE number 4164140 (Why is no real title available?) | 1989-01-01 | Paper |
