Pseudo-natural algorithms for the word problem for finitely presented monoids and groups

This publication has 9 references indexed in Scilit:

• A finite thue system with decidable word problem and without equivalent finite canonical system
  Theoretical Computer Science, 1985
• Finite complete rewriting systems and the complexity of the word problem
  Acta Informatica, 1984
• Decidable sentences of Church-Rosser congruences
  Theoretical Computer Science, 1983
• Confluent and Other Types of Thue Systems
  Journal of the ACM, 1982
• Algorithmische Probleme bei Einrelatorgruppen und ihre Komplexität
  Archive for Mathematical Logic, 1978
• The honest subrecursive classes are a lattice
  Information and Control, 1974
• Strong Computability and Variants of the Uniform Halting Problem
  Mathematical Logic Quarterly, 1971
• Subgroups of finitely presented groups
  Proceedings of the Royal Society of London. Series A. Mathematical and Physical Sciences, 1961
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
  Mathematische Annalen, 1932