Book Chapter
Strict deterministic languages and controlled rewriting systems
Laurent Chottin
Lecture Notes in Computer Science, 1979, Volume 71, Automata, Languages and Programming, Pages 104-117
Book Chapter
Thue systems as rewriting systems
Ronald V. Book
Lecture Notes in Computer Science, 1985, Volume 202, Rewriting Techniques and Applications, Pages 63-94
Book Chapter
A note on confluent Thue systems
Ronald V. Book
Lecture Notes in Computer Science, 1992, Volume 572, Word Equations and Related Topics, Pages 231-236
Book Chapter
Some results about confluence on a given congruence class
Friedrich Otto
Lecture Notes in Computer Science, 1987, Volume 256, Rewriting Techniques and Applications, Pages 145-155
Book Chapter
One-sided Dyck reduction over two letter alphabet and deterministic context-free languages
Fabienne Romian and Jacques Sakarovitch
Lecture Notes in Computer Science, 1986, Volume 233, Mathematical Foundations of Computer Science 1986, Pages 554-563
Book Chapter
Automata and the word problem
John Meakin
Lecture Notes in Computer Science, 1989, Volume 386, Formal Properties of Finite Automata and Applications, Pages 89-103
Book Chapter
Thue systems and the Church-Rosser property
Matthias Jantzen
Lecture Notes in Computer Science, 1984, Volume 176, Mathematical Foundations of Computer Science 1984, Pages 80-95
Book Chapter
On public-key cryptosystem based on Church-Rosser string-rewriting systems
Extended abstract
Vladimir A. Oleshchuk
Lecture Notes in Computer Science, 1995, Volume 959, Computing and Combinatorics, Pages 264-269
Book Chapter
The power of the Church-Rosser property for string rewriting systems
Ronald V. Book
Lecture Notes in Computer Science, 1982, Volume 138, 6th Conference on Automated Deduction, Pages 360-368
Book Chapter
On the complexity of word problems in certain Thue systems
Preliminary report
R. Book, M. Jantzen, B. Monien, C. Ó'Dúnlaing and C. Wrathall
Lecture Notes in Computer Science, 1981, Volume 118, Mathematical Foundations of Computer Science 1981, Pages 216-223