finite automata that certify termination

Alfons Geser, Dieter Hofbauer, Johannes Waldmann, and Hans Zantema: Finding finite automata that certify termination of string rewriting systems. Int. J. Found. Comput. Sci., 2005.

Abstract

We present a technique based on the construction of finite automata to prove termination of string rewriting systems. Using this technique the tools Matchbox and TORPA are able to prove termination of particular string rewriting systems completely automatically for which termination was considered to be very hard until recently.

Note

This is an extended version of that paper.

BiBTeX entry

@ARTICLE{GHWZ-IJFCS05,
AUTHOR = {Alfons Geser and Dieter Hofbauer and Johannes Waldmann and
  Hans Zantema},
TITLE = {Finding finite automata that certify termination of string
  rewriting systems},
JOURNAL = {Int.\ J.\ Found.\ Comput.\ Sci.},
VOLUME = 16,
NUMBER = 3,
YEAR = 2005,
PAGES = {471-486}}

Prof. Dr. Alfons Geser

Last modified: Thu Aug 4 13:53:41 CEST 2005