Commutative monoids have complete presentations by free (non-commutative) monoids
type: Item
instance of: scholarly article
title: Commutative monoids have complete presentations by free (non-commutative) monoids
zbMATH Open document ID: 0607.20032
DOI: 10.1016/0304-3975(86)90037-X
author: Volker Diekert
published in: Theoretical Computer Science
publication date: 1986-01-01T00:00:00Z
review text: It is shown that any finitely generated commutative monoid A has a finite complete presentation in the sense that there exist a finite alphabet X and a finite Noetherian confluent semi-Thue system \(P\subset X^*\times X^*\) such that A is isomorphic to \(X^*/P\).
Mathematics Subject Classification ID: 20M05
Mathematics Subject Classification ID: 20M35
Mathematics Subject Classification ID: 20M14
zbMATH DE Number: 3981440
zbMATH Keywords: finitely generated commutative monoid
zbMATH Keywords: finite complete presentation
zbMATH Keywords: finite alphabet
zbMATH Keywords: finite Noetherian confluent semi-Thue system
reviewed by: Marie Demlová
MaRDI profile type: Publication
cites work: Q3329652
cites work: New decision algorithms for finitely presented commutative semigroups
cites work: Q3848243
cites work: Complete semi-Thue systems for abelian groups
cites work: Presentations of groups and monoids
cites work: A note on a special one-rule semi-Thue system
cites work: A finite Thue system with decidable word problem and without equivalent finite canonical system
cites work: Q5331568
cites work: Word problems and a homological finiteness condition for monoids
full work available at URL: 0304-3975(86)90037-x
OpenAlex ID: W2088247760
description: scientific article; zbMATH DE number 3981440