Termination of string rewriting rules that have one pair of overlaps

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

Volumn 2706, Issue , 2003, Pages 410-423

  Geser, Alfons ^a  

^a National Institute for Aerospace   (United States)

Author keywords

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

Indexed keywords

COMPUTER SCIENCE; COMPUTERS;

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

ARTIFICIAL INTELLIGENCE;

EID: 24944572433     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44881-0_29     Document Type: Conference Paper

References (17)

1. N. Dershowitz, Termination of linear rewriting systems, in Proc. 8th Int. Coll. Automata, Languages and Programming, LNCS 115, Springer, 1981, pp. 448–458.
2. A. Geser, Decidability of termination of grid string rewriting rules, SIAM J. Comput., 31 (2002), pp. 1156–1168.
3. A. Geser, Is termination decidable for string rewriting with only one rule?, habilitation thesis, Wilhelm-Schickard-Institut, Universität Tübingen, Germany, Jan. 2002. 201 pages.
4. A. Geser, Loops of superexponential lengths in one-rule string rewriting, in Proc. 13th Int. Conf. Rewriting Techniques and Applications, S. Tison, ed., LNCS 2378, Springer, 2002, pp. 267–280.
5. M. Hermann, Divergence des systémes de réécriture et schématisation des ensembles infinis de termes, habilitation, Université de Nancy, France, Mar. 1994.
6. Y. Kobayashi, M. Katsura, and K. Shikishima-Tsuji, Termination and derivational complexity of confluent one-rule string rewriting systems, Theoret. Comput. Sci., 262 (2001), pp. 583–632.
7. W. Kurth, Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel, dissertation, Technische Universität Clausthal, Germany, 1990.
8. W. Kurth, One-rule semi-Thue systems with loops of length one, two, or three, RAIRO Inform. Théor., 30 (1995), pp. 415–429.
9. D. S. Lankford and D. R. Musser, A finite termination criterion, tech. rep., Information Sciences Institute, Univ. of Southern California, Marina-del-Rey, CA, 1978.
10. R. McNaughton, The uniform halting problem for one-rule Semi-Thue Systems, Tech. Rep. 94-18, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, Aug. 1994. See also “Correction to ‘The Uniform Halting Problem for One-rule Semi-Thue Systems’”, unpublished paper, Aug., 1996.
11. R. McNaughton, Well-behaved derivations in one-rule Semi-Thue Systems, Tech. Rep. 95- 15, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY, Nov. 1995. See also “Correction by the author to ‘Well-behaved derivations in one-rule Semi-Thue Systems’”, unpublished paper, July, 1996.
12. R. McNaughton, Semi-Thue Systems with an Inhibitor, J. Automated Reasoning, 26 (1997), pp. 409–431.
13. W. Moczydlowski Jr and A. Geser, Termination of single-threaded one-rule Semi-Thue systems, Tech. Rep. TR 02-08 (273), Warsaw University, Dec. 2002. Available electronically at research.nianet.org/∼geser/papers/single.html.
14. G. Sénizergues, On the termination problem for one-rule Semi-Thue Systems, in Proc. 7th Int. Conf. Rewriting Techniques and Applications, H. Ganzinger, ed., LNCS 1103, Springer, 1996, pp. 302–316.
15. K. Shikishima-Tsuji, M. Katsura, and Y. Kobayashi, On termination of confluent one-rule string rewriting systems, Inform. Process. Lett., 61 (1997), pp. 91–96.
16. C. Wrathall, Confluence of one-rule Thue systems, in Word Equations and Related Topics, K. U. Schulz, ed., LNCS 572, Springer, 1992.
17. H. Zantema and A. Geser, A complete characterization of termination of 0p1q → 1r0s, Applicable Algebra in Engineering, Communication, and Computing, 11 (2000), pp. 1–25.