A note on special thue systems with a single defining relation
暂无分享,去创建一个
[1] Matthias Jantzen. On a Special Monoid with a Single Defining Relation , 1981, Theor. Comput. Sci..
[2] Gérard P. Huet,et al. Confluent Reductions: Abstract Properties and Applications to Term Rewriting Systems , 1980, J. ACM.
[3] Y. Cochet,et al. Une Generalisation des Ensembles de Dyck , 1971 .
[4] Donald E. Knuth,et al. Fast Pattern Matching in Strings , 1977, SIAM J. Comput..
[5] M. Schützenberger,et al. The equation $a^M=b^Nc^P$ in a free group. , 1962 .
[6] Maurice Nivat,et al. Congruences parfaites et quasi-parfaites , 1971 .
[7] Colm Ó'Dúnlaing. Finite and infinite regular thue systems , 1981 .
[8] Klaus Madlener,et al. String matching and algorithmic problems in free groups , 1980 .
[9] 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).
[10] M. Newman. On Theories with a Combinatorial Definition of "Equivalence" , 1942 .
[11] Ravi Sethi,et al. Testing for the Church-Rosser Property , 1974, JACM.
[12] Michael J. O'Donnell,et al. Computing in systems described by equations , 1977, Lecture Notes in Computer Science.
[13] Ronald V. Book,et al. Confluent and Other Types of Thue Systems , 1982, JACM.