Thue systems as rewriting systems
Author:
- Ronald V. BookRBRonald V. Book
- 1 February 1987
- journal article
- Published by Elsevier in Journal of Symbolic Computation
- Vol. 3 (1-2) , 39-68
Abstract
No abstract availableKeywords
This publication has 45 references indexed in Scilit:
- Groups presented by finite two-monadic Church-Rosser Thue systemsTransactions of the American Mathematical Society, 1986
- n-level rewriting systemsTheoretical Computer Science, 1985
- NTS languages are deterministic and congruentialJournal of Computer and System Sciences, 1985
- Finite complete rewriting systems and the complexity of the word problemActa Informatica, 1984
- Homogeneous Thue systems and the Church-Rosser propertyDiscrete Mathematics, 1984
- On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoidsRAIRO. Informatique théorique, 1984
- The Nielsen reduction and P-complete problems in free groupsTheoretical Computer Science, 1984
- Decidable sentences of Church-Rosser congruencesTheoretical Computer Science, 1983
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Algorithmische Probleme bei Einrelatorgruppen und ihre KomplexitätArchive for Mathematical Logic, 1978