On normalizing, non-terminating one-rule string rewriting systems

Theoretical Computer Science

Volumn 243, Issue 1-2, 2000, Pages 489-498

  Geser, Alfons ^a  

^a NONE   (Germany)

Author keywords

Innermost terminating; Normalizing; One rule; Rightmost terminating; Semi Thue system; Single rule; String rewriting system; Terminating

Indexed keywords

EID: 0004670082     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0304-3975(00)00167-5     Document Type: Article

References (9)

1. T. Arts, J. Giesl, Termination of term rewriting using dependency pairs, Theoret. Comput. Sci. 236 (2000) 133-178.
2. J.W. Klop, Term rewriting systems, in: S. Abramsky, D.M. Gabbay, T. Maibaum (Eds.), Handbook of Logic in Computer Science, Vol. I, Clarendon Press, Oxford, UK, 1992, pp. 1-116, Chapter 6.
3. W. Kurth, Termination und Konfluenz von Semi-Thue-Systemen mit nur einer Regel, Dissertation, Technische Universität Clausthal, Germany, 1990.
4. W. Magnus, Das Identitätsproblem für Gruppen mit einer definierenden Relation, Math. Ann. 106 (1932) 295-307.
5. Y. Matiyasevitch, G. Sénizergues, Decision problems for semi-Thue systems with a few rules, IEEE Symp. Logic Comput. Sci. (1996).
6. Y. Métivier, Calcul de longuers de chaînes de réécriture dans le monoïde libre, Theoret. Comput. Sci. 35 (1985) 71-87.
7. K. Shikishima-Tsuji, M. Katsura, Y. Kobayashi, On termination of confluent one-rule string rewriting systems, Inf. Process. Lett. 61 (2) (1997) 91-96.
8. C. Wrathall, Confluence of one-rule Thue systems, in: K.U. Schulz (Ed.), Word equations and related topics, Lecture Notes in Computer Science, vol. 572, Springer, Berlin, 1991.
9. H. Zantema, A. Geser, Non-looping string rewriting, Theoret. Inform. Appl. 33 (1999) 279-301.