Thue systems as rewriting systems
- 1 January 1985
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 35 references indexed in Scilit:
- 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
- A note on special thue systems with a single defining relationTheory of Computing Systems, 1983
- Decidable sentences of Church-Rosser congruencesTheoretical Computer Science, 1983
- Monadic Thue systemsTheoretical Computer Science, 1982
- When is a monoid a group? the Church-Rosser case is tractableTheoretical Computer Science, 1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Thue congruences and the Church-Rosser propertySemigroup Forum, 1981
- Algorithmische Probleme bei Einrelatorgruppen und ihre KomplexitätArchive for Mathematical Logic, 1978