Non-looping string rewriting

Theoretical Informatics and Applications

Volumn 33, Issue 3, 1999, Pages 279-301

  Geser, Alfons ^a   Zantema, Hans ^b  

^a UNIVERSITY OF TÜBINGEN   (Germany)

^b UTRECHT UNIVERSITY   (Netherlands)

Author keywords

[No Author keywords available]

Indexed keywords

MATHEMATICAL MODELS; MATHEMATICAL TRANSFORMATIONS;

STRING REWRITING;

COMPUTATIONAL LINGUISTICS;

EID: 0033293230     PISSN: 09883754     EISSN: None     Source Type: Journal    
DOI: 10.1051/ita:1999118     Document Type: Article

References (26)

1. S. Adjan and G. Oganesjan, Problems of equality and divisibility in semigroups with a single defining relation. Mat. Zametki 41 (1987) 412-421.
2. R. Book and F. Otto, String-rewriting systems. Texts and Monographs in Computer Science. Springer, New York (1993).
3. N. Dershowitz, Termination of linear rewriting systems. In Proc. of the 8th International Colloquium on Automata, Languages and Programming (ICALP81), Springer, Lecture Notes in Computer Science 115 (1981) 448-458.
4. N. Dershowitz, Termination of rewriting. J. Symb. Comput. 3 (1987) 69-115; Corrigendum 4 (1987) 409-410.
5. N. Dershowitz, Termination of rewriting. J. Symb. Comput. 3 (1987) 69-115; Corrigendum 4 (1987) 409-410.
6. N. Dershowitz and C. Hoot, Natural termination. Theoret. Comput. Sci. 142 (1995) 179-207.
7. M. Ferreira and H. Zantema, Dummy elimination: Making termination easier. In Proc. 10th Conf. Fundamentals of Computation Theory, H. Reichel, Ed., Springer, Lecture Notes in Computer Science 965 (1995) 243-252.
8. A. Geser, Termination of one-rule string rewriting systems ℓ. → r where |r| ≤ 9. Tech. Rep., Universität Tübingen, D (Jan. 1998).
9. J.V. Guttag, D. Kapur and D.R. Musser, On proving uniform termination and restricted termination of rewriting systems. SIAM J. Comput. 12 (1983) 189-214.
10. G. Huet and D.S. Lankford, On the uniform halting problem for term rewriting systems. Rapport Laboria 283, INRIA (1978).
11. M. Jantzen, Confluent string rewriting, Vol. 14 of EATCS Monographs on Theoretical Computer Science. Springer, Berlin (1988).
12. Y. Kobayashi, M. Katsura and K. Shikishima-Tsuji, Termination and derivational complexity of confluent one-rule string rewriting systems. Tech. Rep., Dept. of Computer Science, Toho University, JP (1997).
13. W. Kurth, Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel. Dissertation, Technische Universität Clausthal, Germany (1990).
14. W. Kurth, One-rule semi-Thue systems with loops of length one, two, or three. RAIRO Theoret. Informatics Appl. 30 (1995) 415-429.
15. 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).
16. Y. Matiyasevitch and G. Sénizergues, Decision problems for semi-Thue systems with a few rules. In IEEE Symp. Logic in Computer Science'96 (1996).
17. 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", personal communication (Aug. 1996).
18. 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", personal communication (Aug. 1996).
19. 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).
20. R. McNaughton, Semi-Thue Systems with an inhibitor. Tech. Rep. 97-5, Dept. of Computer Science, Rensselaer Polytechnic Institute, Troy, NY (1997).
21. F. Otto, The undecidability of self-embedding for finite semi-Thue and Thue systems. Theoret. Comput. Sci. 47 (1986) 225-232.
22. B.K. Rosen, Tree-manipulating systems and Church-Rosser Theorems. J. ACM 20 (1973) 160-187.
23. K. Shikishima-Tsuji, M. Katsura and Y. Kobayashi, On termination of confluent one-rule string rewriting systems. Inform. Process. Lett. 61 (1997) 91-96.
24. C. Wrathall, Confluence of one-rule Thue systems. In Word Equations and Related Topics, K.U. Schulz, Ed., Springer, Lecture Notes in Computer Science 572 (1991).
25. s. Applicable Algebra in Engineering, Communication, and Computing. In print.
26. s. In Proc. of the 6th Conference on Rewriting Techniques and Applications, J. Hsiang, Ed., Springer, Lecture Notes in Computer Science 914 (1995) 41-55.