The following pages link to (Q3917482):
Displaying 29 items.
- Natural termination (Q673622) (← links)
- Termination of string rewriting proved automatically (Q850497) (← links)
- On tree automata that certify termination of left-linear term rewriting systems (Q876043) (← links)
- Overlap closures do not suffice for termination of general term rewriting systems (Q922713) (← links)
- Matrix interpretations for proving termination of term rewriting (Q928655) (← links)
- Loop detection in term rewriting using the eliminating unfoldings (Q944383) (← links)
- Match-bounds revisited (Q1041044) (← links)
- Termination of rewriting (Q1098624) (← links)
- Corrigendum to ``Termination of rewriting'' (Q1098625) (← links)
- The Church-Rosser property for ground term-rewriting systems is decidable (Q1100890) (← links)
- Counterexamples to termination for the direct sum of term rewriting systems (Q1107975) (← links)
- Modularity of simple termination of term rewriting systems with shared constructors (Q1199539) (← links)
- Decidability for left-linear growing term rewriting systems. (Q1400714) (← links)
- Match-bounded string rewriting systems (Q1762560) (← links)
- Derivation trees of ground term rewriting systems. (Q1854289) (← links)
- Right-linear half-monadic term rewrite systems (Q1884902) (← links)
- Jumping and escaping: modular termination and the abstract path ordering (Q1929229) (← links)
- Termination of term rewriting using dependency pairs (Q1978641) (← links)
- Decidability of innermost termination and context-sensitive termination for semi-constructor term rewriting systems (Q2873675) (← links)
- Undecidable properties on length-two string rewriting systems (Q2873677) (← links)
- Match-Bounds with Dependency Pairs for Proving Termination of Rewrite Systems (Q3540124) (← links)
- Non-Looping String Rewriting (Q4718895) (← links)
- Termination for the direct sum of left-linear term rewriting systems (Q5055740) (← links)
- Completeness of combinations of constructor systems (Q5055759) (← links)
- On relationship between term rewriting systems and regular tree languages (Q5055769) (← links)
- Topics in termination (Q5055795) (← links)
- Decidable approximations of term rewriting systems (Q5055873) (← links)
- (Q5089023) (← links)
- Proving convergence of self-stabilizing systems using first-order rewriting and regular languages (Q5138353) (← links)
