A note on special thue systems with a single defining relation

1. J. Avenhaus and K. Madlener. String matching and algorithmic problems in free groups,Revista Columbiana de Matematicas 14, 1–16 (1980).

   Google Scholar 

2. J. Berstel. Congruences plus que parfaites et languages algebrique,Seminaire d'Informatique Theorique (1976–77), Institut de Programmation, 123–147.

3. R. Book. Confluent and other types of Thue systems,J. Assoc. Comput. Mach. 29 (1982), to appear.

4. R. Book and C. O'Dunlaing. Testing for the Church-Rosser property,Theoret. Comp. Sci. 16, 223–229 (1981).

   Google Scholar 

5. Y. Cochet and M. Nivat. Une generalization des ensembles de Dyck,Israel J. Math. 9, 389–395 (1971).

   Google Scholar 

6. G. Huet. Confluent reductions: abstract properties and applications to term rewriting systems,J. Assoc. Comput. Mach. 27, 797–821 (1980).

   Google Scholar 

7. M. Jantzen. On a special monoid with a single defining relation,Theoret. Comp. Sci. 16, 61–73 (1981).

   Google Scholar 

8. D. Kunth, J. Morris, and V. Pratt. Fast pattern matching in strings,SIAM J. Computing 6, 323–350 (1977).

   Google Scholar 

9. R. Lyndon and M. Schutzenberger. The equationa ^M =b ^N c ^P in a free group,Michigan Math. J. 9, 289–298 (1962).

   Google Scholar 

10. M. H. A. Newman. On theories with a combinatorial definition of “equivalence,”Annals Math. 43, 223–243 (1942).

    Google Scholar 

11. M. Nivat (with M. Benois). Congruences parfaites et quasi-parfaites, Seminaire Dubriel, 25^e Annee (1971–72), 7-01-09.

12. M. O'Donnell.Computing in Systems Described by Equations, Lecture Notes in Computer Science 58 (1977), Springer-Verlag.

13. C. O'Dunlaing. Finite and infinite regular Thue systems, Ph.D. dissertation, University of California at Santa Barbara, 1981.

14. B. Rosen. Tree manipulating systems and the Church-Rosser systems,J. Assoc. Comput. Mach. 20 (1973), 160–187.

    Google Scholar 

Download references