Abstract
A combinatorial characterization is given for those one-rule Thue systems of the form {(w 1,w 2)} with 0≦ |w 2|≦|ov(w 1)| that are Church-Rosser. Here ov(w 1) denotes the longest proper self-overlap ofw 1. Further, it is shown that a Thue system of this form is Church-Rosser if and only if there is an equivalent Thue system that is Church-Rosser.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
S. I. Adjan,Defining relations and algorithmic problems for groups and semigroups, Proceedings of the Steklov Institute of Mathematics 85 (1966), Amer. Math. Soc., 1967.
J. Avenhaus and K. Madlener, String matching and algorithmic problems in free groups,Revista Colombiana de Matematicas 14, 1–16 (1980).
J. Berstel, Congruences plus que parfaites et langages algébriques,Séminaire d'Informatique Théorique, Institut de Programmation, 1976–77, 123–147.
R. Book, Confluent and other types of Thue systems,J. Assoc. Comput. Mach. 29, 171–182 (1982).
R. Book, A note on special Thue systems with a single defining relation,Math. Systems Theory 16, 57–60 (1983).
R. Book, Homogeneous Thue systems and the Church-Rosser property,Discrete Mathematics 48, 137–145 (1984).
R. Book and C. O'Dúnlaing, Testing for the Church-Rosser property,Theoret. Comp. Sci. 16, 223–229 (1981).
Y. Cochet and M. Nivat, Une generalization des ensembles de Dyck,Israel J. Math. 9, 389–395 (1971).
G. Huet, Confluent reductions: Abstract properties and applications to term rewriting systems,J. Assoc. Comp. Mach. 27, 797–821 (1980).
D. Kapur, M. Krishnamoorthy, R. McNaughton, and P. Narendran, AnO(|T|3) algorithm for testing the Church-Rosser property of Thue systems,Theoret. Comp. Sci. 35, 109–114 (1985).
D. Knuth, J. Morris, and V. Pratt, Fast pattern matching in strings,SIAM J. Computing 6, 323–350 (1977).
G. Lallement,Semigroups and combinatorial applications, Wiley-Interscience, 1979.
G. Lallement, On monoids presented by a single relation,Journal of Algebra 32, 370–388 (1974).
M. Lothaire,Combinatorics on words, Addison-Wesley, 1983.
R. C. Lyndon and M. P. Schützenberger, The equationa M =b N c P in a free group,Mich. Math. J. 9, 289–298 (1962).
W. Magnus, A. Karrass, and D. Solitar,Combinatorial group theory, 2nd Revised Ed., Dover Publications, New York, 1976.
M. H. A. Newman, On theories with a combinatorial definition of equivalence,Annals Math. 43, 223–243 (1942).
M. Nivat (with M. Benois), Congruences parfaites et quasiparfaites,Séminaire Dubriel, 25e Année, 1971–72, 7-01-09.
M. O'Donnell,Computing in systems described by equations, Lecture Notes in Computer Science 58 (1977), Springer-Verlag.
C. O'Dúnlaing, Undecidable questions related to Church-Rosser Thue systems,Theoret. Comp. Sci. 23, 339–345 (1983).
C. O'Dúnlaing, Infinite regular Thue systems,Theoret. Comp. Sci. 25, 171–192 (1983).
B. Rosen, Tree manipulating systems and the Church-Rosser property,J. Assoc. Comp. Mach. 20, 160–187 (1973).
Author information
Authors and Affiliations
Additional information
This research was supported in part by the National Science Foundation under Grant No. MCS83-14977. It was performed while the first author was visiting the Department of Mathematics of the University of California at Santa Barbara.
Rights and permissions
About this article
Cite this article
Otto, F., Wrathall, C. A note on thue systems with a single defining relation. Math. Systems Theory 18, 135–143 (1985). https://doi.org/10.1007/BF01699465
Received:
Revised:
Issue Date:
DOI: https://doi.org/10.1007/BF01699465