A finitely presented monoid which has solvable word problem but has no regular complete presentation
type: Item
instance of: scholarly article
title: A finitely presented monoid which has solvable word problem but has no regular complete presentation
zbMATH Open document ID: 0873.68105
DOI: 10.1016/0304-3975(94)00264-J
author: Yuji Kobayashi
published in: Theoretical Computer Science
publication date: 1997-02-28T00:00:00Z
Mathematics Subject Classification ID: 68Q42
zbMATH DE Number: 985395
zbMATH Keywords: rewriting systems
MaRDI profile type: Publication
cites work: Systems of reductions
cites work: Q4846257
cites work: Über die Gelfand-Kirillov-Dimension. (On the Gelfand-Kirillov-dimension)
cites work: Growth functions for some one-relator monoids
cites work: Presentations of groups and monoids
cites work: Q4011119
cites work: Q5592263
cites work: A finite Thue system with decidable word problem and without equivalent finite canonical system
cites work: The Knuth-Bendix Completion Procedure and Thue Systems
cites work: Infinite regular Thue systems
cites work: Word problems and a homological finiteness condition for monoids
cites work: Q3026992
cites work: Q3952128
full work available at URL: 0304-3975(94)00264-j
OpenAlex ID: W1975351486
description: scientific article; zbMATH DE number 985395