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.
Original language | English |
---|---|
Pages (from-to) | 471-486 |
Journal | International Journal of Foundations of Computer Science |
Volume | 16 |
Issue number | 3 |
DOIs | |
Publication status | Published - 2005 |