Loops of superexponential lengths in one-rule string rewriting

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2378, Issue , 2002, Pages 267-280

  Geser, Alfons ^a  

^a NASA LANGLEY RESEARCH CENTER   (United States)

Author keywords

Loop; One rule; Semi Thue system; Single rule; String rewriting; Termination; Uniform termination

Indexed keywords

ARTIFICIAL INTELLIGENCE; COMPUTER SCIENCE; COMPUTERS;

LOOP; ONE-RULE; SEMI-THUE SYSTEM; SINGLE-RULE; STRING REWRITING; TERMINATION; UNIFORM TERMINATION;

COMPUTABILITY AND DECIDABILITY;

EID: 84861397879     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45610-4_19     Document Type: Conference Paper

References (21)

1. Ronald Book and Friedrich Otto. String-rewriting systems. Texts and Monographs in Computer Science. Springer, New York, 1993.
2. Nachum Dershowitz. Termination of linear rewriting systems. In Proc. 8th Int. Coll. Automata, Languages and Programming, LNCS 115, pages 448–458. Springer, 1981.
3. Nachum Dershowitz. Termination of rewriting. J. Symb. Comput., 3(1&2):69–115, Feb./April 1987. Corrigendum: 4, 3, Dec. 1987, 409-410.
4. Alfons Geser. Note on normalizing, non-terminating one-rule string rewriting systems. Theoret. Comput. Sci., 243:489–498, 2000.
5. Alfons Geser. Decidability of termination of grid string rewriting rules. SIAMJ. Comput., 2002. In print.
6. Alfons Geser and Hans Zantema. Non-looping string rewriting. Theoret. Informatics Appl., 33(3):279–301, 1999.
7. Miki Hermann. Divergence des systèmes de réécriture et schématisation des ensembles infinis de termes. Habilitation, Université de Nancy, France, March 1994.
8. Gérard Huet and Dallas S. Lankford. On the uniform halting problem for term rewriting systems. Technical Report 283, INRIA, Rocquencourt, FR, March 1978.
9. Matthias Jantzen. Confluent string rewriting, volume 14 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin, 1988.
10. 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.
11. Winfried Kurth. Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany, 1990.
12. 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.
13. 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.
14. 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.
15. 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 ‘Wellbehaved derivations in one-rule Semi-Thue Systems’”, unpublished paper, July, 1996.
16. Robert McNaughton. Semi-Thue Systems with an Inhibitor. J. Automated Reasoning, 26:409–431, 1997.
17. Paliath Narendran and Friedrich Otto. The problems of cyclic equality and conjugacy for finite complete rewriting systems. Theoret. Comput. Sci., 47:27–38, 1986.
18. Michael J. O’Donnell. Computing in systems described by equations. LNCS 58. Springer, 1977.
19. Geraud Sénizergues. On the termination problem for one-rule Semi-Thue Systems. In RTA-7, LNCS 1103, pages 302–316. Springer, 1996.
20. 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.
21. 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.