Complete rewriting systems and homology of monoid algebras
Author:
- Yuji KobayashiYKYuji Kobayashi
- 1 September 1990
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 65 (3) , 263-275
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- Word problems and a homological finiteness condition for monoidsJournal of Pure and Applied Algebra, 1987
- The word problem for finitely presented monoids and finite canonical rewriting systemsLecture Notes in Computer Science, 1987
- On the homology of associative algebrasTransactions of the American Mathematical Society, 1986
- A finite thue system with decidable word problem and without equivalent finite canonical systemTheoretical Computer Science, 1985
- The Knuth-Bendix Completion Procedure and Thue SystemsSIAM Journal on Computing, 1985