The Power of the Church-Rosser Property for String Rewriting Systems

[1]  Matthias Jantzen.  On a Special Monoid with a Single Defining Relation , 1981, Theor. Comput. Sci..

[2]  Maurice Nivat,et al.  Congruences parfaites et quasi-parfaites , 1971 .

[3]  G. Huet,et al.  Equations and rewrite rules: a survey , 1980 .

[4]  Gérard P. Huet,et al.  Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.

[5]  Michael J. O'Donnell,et al.  Computing in systems described by equations , 1977, Lecture Notes in Computer Science.

[6]  Ronald V. Book,et al.  Monadic Thue Systems , 1982, Theor. Comput. Sci..

[7]  Colm Ó'Dúnlaing.  Finite and infinite regular thue systems , 1981 .

[8]  D. Knuth,et al.  Simple Word Problems in Universal Algebras , 1983 .

[9]  Albert R. Meyer,et al.  The Equivalence Problem for Regular Expressions with Squaring Requires Exponential Space , 1972, SWAT.

[10]  Y. Cochet,et al.  Une Generalisation des Ensembles de Dyck , 1971 .

[11]  Gerard Huet,et al.  Conflunt reductions: Abstract properties and applications to term rewriting systems , 1977, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977).

[12]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.

[13]  Ronald V. Book,et al.  Confluent and Other Types of Thue Systems , 1982, JACM.

[14]  A. Gill.  SWITCHING AND AUTOMATA THEORY. , 1970 .

[15]  Jörg H. Siekmann,et al.  A short survey on the state of the art in matching and unification problems , 1979, SIGS.

[16]  Maurice Nivat.  On some families of languages related to the Dyck language , 1970, STOC '70.

[17]  Donald E. Knuth,et al.  Simple Word Problems in Universal Algebras††The work reported in this paper was supported in part by the U.S. Office of Naval Research. , 1970 .

[18]  Colm Ó'Dúnlaing,et al.  Testing for the Church-Rosser Property , 1981, Theor. Comput. Sci..

[19]  T. G. Szymanski,et al.  On the Equivalence, Containment, and Covering Problems for the Regular and Context-Free Languages , 1976, J. Comput. Syst. Sci..

[20]  Ronald V. Book.  When is a Monoid a Group? The Church-Rosser Case is Tractable , 1982, Theor. Comput. Sci..

[21]  G. Lallement.  Semigroups and combinatorial applications , 1979 .