Finite complete rewriting systems and the complexity of the word problem
- 1 December 1984
- journal article
- research article
- Published by Springer Nature in Acta Informatica
- Vol. 21 (5) , 521-540
- https://doi.org/10.1007/bf00271645
Abstract
No abstract availableKeywords
This publication has 12 references indexed in Scilit:
- A finite thue system with decidable word problem and without equivalent finite canonical systemTheoretical Computer Science, 1985
- Finite complete rewriting systems for the Jantzen monoid and the greendlinger groupTheoretical Computer Science, 1984
- Undecidable questions related to Church-Rosser Thue systemsTheoretical Computer Science, 1983
- Confluent and Other Types of Thue SystemsJournal of the ACM, 1982
- Computer AlgebraPublished by Springer Nature ,1982
- Confluent Reductions: Abstract Properties and Applications to Term Rewriting SystemsJournal of the ACM, 1980
- On the density of honest subrecursive classesJournal of Computer and System Sciences, 1975
- Strong Computability and Variants of the Uniform Halting ProblemMathematical Logic Quarterly, 1971
- Machine Configuration and Word Problems of Given Degree of UnsolvabilityMathematical Logic Quarterly, 1965
- On Theories with a Combinatorial Definition of "Equivalence"Annals of Mathematics, 1942