Finite complete rewriting systems for the Jantzen monoid and the greendlinger group
Author:
- Friedrich OttoFOFriedrich Otto
- 31 December 1984
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 32 (3) , 249-260
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- The undecidability of the preperfectness of thue systemsTheoretical Computer Science, 1984
- On expressing commutativity by finite Church-Rosser presentations : a note on commutative monoidsRAIRO. Informatique théorique, 1984
- When is a monoid a group? the Church-Rosser case is tractableTheoretical Computer Science, 1982
- Orderings for term-rewriting systemsTheoretical Computer Science, 1982
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Testing for the Church-Rosser propertyTheoretical Computer Science, 1981
- On a special monoid with a single defining relationTheoretical Computer Science, 1981
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- Subrekursive Komplexität bei GruppenActa Informatica, 1977
- Dehn's algorithm for the word problemCommunications on Pure and Applied Mathematics, 1960