The word problem for finitely presented monoids and finite canonical rewriting systems
- 1 January 1987
- book chapter
- Published by Springer Nature
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Complete semi-Thue systems for abelian groupsTheoretical Computer Science, 1986
- Pseudo-natural algorithms for the word problem for finitely presented monoids and groupsJournal of Symbolic Computation, 1985
- A finite thue system with decidable word problem and without equivalent finite canonical systemTheoretical Computer Science, 1985
- n-level rewriting systemsTheoretical Computer Science, 1985
- A note on a special one-rule semi-Thue systemInformation Processing Letters, 1985
- Thue systems as rewriting systemsLecture Notes in Computer Science, 1985
- Finite complete rewriting systems and the complexity of the word problemActa Informatica, 1984
- Monadic Thue systemsTheoretical Computer Science, 1982
- A connection between the integral homology and the centre of a rational linear groupMathematische Zeitschrift, 1980
- Subrekursive Komplexität bei GruppenActa Informatica, 1977