Finding finite automata that certify termination of string rewriting

Authors:
Alfons Geser;Dieter Hofbauer;Johannes Waldmann;Hans Zantema
Affiliations:
National Institute of Aerospace, Hampton, Virginia;Mühlengasse 16, Kassel, Germany;Hochschule für Technik, Wirtschaft und Kultur (FH) Leipzig, Fb IMN, Leipzig, Germany;Department of Computer Science, Technische Universiteit Eindhoven, Eindhoven, The Netherlands
Venue:
CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata
Year:
2004

Citing 7
Cited 2

String-rewriting systems

String-rewriting systems
Context-Limited Grammars

Journal of the ACM (JACM)
Termination of Linear Rewriting Systems (Preliminary Version)

Proceedings of the 8th Colloquium on Automata, Languages and Programming
Peg-Solitaire, String Rewriting Systems and Finite Automata

ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
Match-Bounded String Rewriting Systems

Applicable Algebra in Engineering, Communication and Computing
Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
Deleting string rewriting systems preserve regularity

DLT'03 Proceedings of the 7th international conference on Developments in language theory

Termination of String Rewriting Proved Automatically

Journal of Automated Reasoning
On tree automata that certify termination of left-linear term rewriting systems

RTA'05 Proceedings of the 16th international conference on Term Rewriting and Applications

Quantified Score

Hi-index	0.00

Visualization

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.