Abstract
Loops are the most frequent cause of non-termination in string rewriting. In the general case, non-terminating, non-looping string rewriting systems exist, and the uniform termination problem is undecidable. For rewriting with only one string rewriting rule, it is unknown whether non-terminating, non-looping systems exist and whether uniform termination is decidable. If in the one-rule case, non-termination is equivalent to the existence of loops, as McNaughton conjectures, then a decision procedure for the existence of loops also solves the uniform termination problem. As the existence of loops of bounded lengths is decidable, the question is raised how long shortest loops may be. We show that string rewriting rules exist whose shortest loops have superexponential lengths in the size of the rule.
This work was supported by the National Aeronautics and Space Administration under NASA Contract No. NAS1-97046 while the author was in residence at ICASE.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Ronald Book and Friedrich Otto. String-rewriting systems. Texts and Monographs in Computer Science. Springer, New York, 1993.
Nachum Dershowitz. Termination of linear rewriting systems. In sProc. 8th Int. Coll. Automata, Languages and Programming, LNCS 115, pages 448–458. Springer, 1981.
Nachum Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1&2):69–115, Feb./April 1987. Corrigendum: 4, 3, Dec. 1987, 409–410.
Alfons Geser. Note on normalizing, non-terminating one-rule string rewriting systems. Theoret. Comput. Sci., 243:489–498, 2000.
Alfons Geser. Decidability of termination of grid string rewriting rules. SIAM J. Comput., 2002. In print.
Alfons Geser and Hans Zantema. Non-looping string rewriting. Theoret. Informatics Appl., 33(3):279–301, 1999.
Miki Hermann. Divergence des systèmes de réécriture et schématisation des ensembles infinis de termes. Habilitation, Université de Nancy, France, March 1994.
Gérard Huet and Dallas S. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Rocquencourt, FR, March 1978.
Matthias Jantzen. Confluent string rewriting, volume 14 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1988.
Yuji Kobayashi, Masashi Katsura, and Kayoko Shikishima-Tsuji. Termination and derivational complexity of confluent one-rule string rewriting systems. Theoret. Comput. Sci., 262(1/2):583–632, 2001.
Winfried Kurth. Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany, 1990.
Dallas S. Lankford and D. R. Musser. A finite termination criterion. Technical report, Information Sciences Institute, Univ. of Southern California, Marina-del-Rey, CA, 1978.
Yuri Matiyasevitch and Geraud Sénizergues. Decision problems for semi-Thue systems with a few rules. In Proc. 11th IEEE Symp. Logic in Computer Science, pages 523–531, New Brunswick, NJ, July 1996. IEEE Computer Society Press.
Robert McNaughton. The uniform halting problem for one-rule Semi-Thue Systems. Technical Report 94-18, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, August 1994. See also “Correction to ‘The Uniform Halting Problem for One-rule Semi-Thue Systems’”, unpublished paper, August, 1996.
Robert McNaughton. Well-behaved derivations in one-rule Semi-Thue Systems. Technical Report 95-15, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, November 1995. See also “Correction by the author to ‘Well-behaved derivations in one-rule Semi-Thue Systems’”, unpublished paper, July, 1996.
Robert McNaughton. Semi-Thue Systems with an Inhibitor. J. Automated Reasoning, 26:409–431, 1997.
Paliath Narendran and Friedrich Otto. The problems of cyclic equality and con-jugacy for finite complete rewriting systems. Theoret. Comput. Sci., 47:27–38, 1986.
Michael J. O’Donnell. Computing in systems described by equations. LNCS 58. Springer, 1977.
Geraud Sénizergues. On the termination problem for one-rule Semi-Thue Systems. In RTA-7, LNCS 1103, pages 302–316. Springer, 1996.
Kayoko Shikishima-Tsuji, Masashi Katsura, and Yuji Kobayashi. On termination of confluent one-rule string rewriting systems. Inform. Process. Lett., 61(2):91–96, 1997.
Hans Zantema and Alfons Geser. A complete characterization of termination of 0p1q → 1r0s. Applicable Algebra in Engineering, Communication, and Computing, 11(1):1–25, 2000.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Geser, A. (2002). Loops of Superexponential Lengths in One-Rule String Rewriting. In: Tison, S. (eds) Rewriting Techniques and Applications. RTA 2002. Lecture Notes in Computer Science, vol 2378. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45610-4_19
Download citation
DOI: https://doi.org/10.1007/3-540-45610-4_19
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43916-5
Online ISBN: 978-3-540-45610-0
eBook Packages: Springer Book Archive