scientific article; zbMATH DE number 3729436

Cited in

(30)

Match-bounds revisited
Termination of rewriting
Corrigendum to ``Termination of rewriting
The Church-Rosser property for ground term-rewriting systems is decidable
Counterexamples to termination for the direct sum of term rewriting systems
Modularity of simple termination of term rewriting systems with shared constructors
Decidability for left-linear growing term rewriting systems.
Match-bounded string rewriting systems
Derivation trees of ground term rewriting systems.
Right-linear half-monadic term rewrite systems
Jumping and escaping: modular termination and the abstract path ordering
Termination of term rewriting using dependency pairs
Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems
Undecidable properties on length-two string rewriting systems
Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems
Non-Looping String Rewriting
Termination for the direct sum of left-linear term rewriting systems
Completeness of combinations of constructor systems
On relationship between term rewriting systems and regular tree languages
Topics in termination
Decidable approximations of term rewriting systems
Sparse tiling through overlap closures for termination of string rewriting
Proving convergence of self-stabilizing systems using first-order rewriting and regular languages
On termination of graph rewriting
Natural termination
Termination of string rewriting proved automatically
On tree automata that certify termination of left-linear term rewriting systems
Overlap closures do not suffice for termination of general term rewriting systems
Matrix interpretations for proving termination of term rewriting
Loop detection in term rewriting using the eliminating unfoldings

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3917482)