The following publications are possibly variants of this publication:
- Termination of String Rewriting Rules That Have One Pair of OverlapsAlfons Geser. RTA 2003: 410-423 [doi]
- Termination of String Rewriting with Matrix InterpretationsDieter Hofbauer, Johannes Waldmann. RTA 2006: 328-342 [doi]
- Finding Finite Automata That Certify Termination of String RewritingAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. wia 2004: 134-145 [doi]
- Weighted Automata for Proving Termination of String RewritingJohannes Waldmann. jalc, 12(4):545-570, 2007.
- Finding finite automata that certify termination of string rewriting systemsAlfons Geser, Dieter Hofbauer, Johannes Waldmann, Hans Zantema. ijfcs, 16(3):471-486, 2005. [doi]
- Termination Proofs for String Rewriting Systems via Inverse Match-BoundsAlfons Geser, Dieter Hofbauer, Johannes Waldmann. JAR, 34(4):365-385, 2005. [doi]
- Decidability of Termination of Grid String Rewriting RulesAlfons Geser. SICOMP, 31(4):1156-1168, 2002. [doi]