Dieter Hofbauer

Fred Mesnard

Étienne Payet

CoRR, 2023

Old and New Benchmarks for Relative Termination of String Rewrite Systems.

[BibT_eX]

[DOI]

CoRR, 2023

2019

Sparse Tiling Through Overlap Closures for Termination of String Rewriting.

[BibT_eX]

[DOI]

Alfons Geser

Proceedings of the 4th International Conference on Formal Structures for Computation and Deduction, 2019

2010

Finding and Certifying Loops.

[BibT_eX]

[DOI]

Proceedings of the SOFSEM 2010: Theory and Practice of Computer Science, 2010

2007

On tree automata that certify termination of left-linear term rewriting systems.

[BibT_eX]

[DOI]

Inf. Comput., 2007

2006

Termination of {aa->bc, bb->ac, cc->ab}.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2006

Termination of String Rewriting with Matrix Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

2005

On state-alternating context-free grammars.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Termination Proofs for String Rewriting Systems via Inverse Match-Bounds.

[BibT_eX]

[DOI]

Alfons Geser

J. Autom. Reason., 2005

Finding finite automata that certify termination of string rewriting systems.

[BibT_eX]

[DOI]

Int. J. Found. Comput. Sci., 2005

2004

Deleting string rewriting systems preserve regularity.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2004

Match-Bounded String Rewriting Systems.

[BibT_eX]

[DOI]

Alfons Geser

Appl. Algebra Eng. Commun. Comput., 2004

Finding Finite Automata That Certify Termination of String Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Implementation and Application of Automata, 2004

2003

An upper bound on the derivational complexity of Knuth-Bendix orderings.

[BibT_eX]

[DOI]

Inf. Comput., 2003

2002

Test Sets for the Universal and Existential Closure of Regular Tree Languages.

[BibT_eX]

[DOI]

Inf. Comput., 2002

2001

Termination Proofs for Ground Rewrite Systems - Interpretations and Derivational Complexity.

[BibT_eX]

[DOI]

Appl. Algebra Eng. Commun. Comput., 2001

Termination Proofs by Context-Dependent Interpretations.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

1994

Linearizing Term Rewriting Systems Using Test Sets.

[BibT_eX]

[DOI]

J. Symb. Comput., 1994

Some Results on Top-Context-Free Tree Languages.

[BibT_eX]

[DOI]

Gregory Kucherov

Proceedings of the Trees in Algebra and Programming, 1994

1992

Termination proofs and derivation lengths in term rewriting systems.

[BibT_eX]

[DOI]

PhD thesis, 1992

Termination Proofs by Multiset Path Orderings Imply Primitive Recursive Derivation Lengths.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1992

Computing Linearizations Using Test Sets.

[BibT_eX]

[DOI]

Proceedings of the Conditional Term Rewriting Systems, Third International Workshop, 1992

1991

Time Bounded Rewrite Systems and Termination Proofs by Generalized Embedding.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

1989

Termination Proofs and the Length of Derivations (Preliminary Version).

[BibT_eX]

[DOI]

Clemens Lautemann

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

Grundlagen des maschinellen Beweisens - eine Einführung für Informatiker und Mathematiker.

[BibT_eX]

Ralf-Detlef Kutsche

Vieweg, ISBN: 978-3-528-04718-4, 1989

1988

Proving Inductive Theorems Based on Term Rewriting Systems.

[BibT_eX]

[DOI]

Ralf-Detlef Kutsche

Proceedings of the Algebraic and Logic Programming, 1988

Proving Inductive Theorems in Equational Theories.

[BibT_eX]