FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS-Reference-Cited by-同舟云学术

FINDING FINITE AUTOMATA THAT CERTIFY TERMINATION OF STRING REWRITING SYSTEMS

Published:2005-06 Issue:03 Volume:16 Page:471-486
ISSN:0129-0541
Container-title:International Journal of Foundations of Computer Science
language:en
Short-container-title:Int. J. Found. Comput. Sci.

Author:

GESER ALFONS¹,HOFBAUER DIETER²,WALDMANN JOHANNES³,ZANTEMA HANS⁴

Affiliation:

1. National Institute of Aerospace, 144 Research Drive, Hampton, Virginia 23666, USA

2. Mühlengasse 16, D-34125 Kassel, Germany

3. Hochschule für Technik, Wirtschaft und Kultur (FH) Leipzig, Fb IMN, PF 30 11 66, D-04251 Leipzig, Germany

4. Faculteit Wiskunde en Informatica, Technische Universiteit Eindhoven, Postbus 513, 5600 MB Eindhoven, The Netherlands

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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Computer Science (miscellaneous)

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0129054105003108

Reference21 articles.

1. Monadic Thue systems

2. Cancellation rules and extended word problems

3. String-Rewriting Systems

4. A proof-theoretical investigation of Zantema's problem

5. Termination of linear rewriting systems

Cited by 7 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Efficient Completion of Weighted Automata;Electronic Proceedings in Theoretical Computer Science;2016-09-10

2. Match-bounds revisited;Information and Computation;2009-11

3. Automatic Termination;Rewriting Techniques and Applications;2009

4. On tree automata that certify termination of left-linear term rewriting systems;Information and Computation;2007-04

5. Termination by Quasi-periodic Interpretations;Lecture Notes in Computer Science;2007