Commutative monoids have complete presentations by free (non-commutative) monoids

DOI10.1016/0304-3975(86)90037-XzbMath0607.20032OpenAlexW2088247760MaRDI QIDQ1085284

Volker Diekert

Publication date: 1986

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0304-3975(86)90037-x

zbMATH Keywords

finite alphabetfinite complete presentationfinite Noetherian confluent semi-Thue systemfinitely generated commutative monoid

Mathematics Subject Classification ID

Commutative semigroups (20M14) Free semigroups, generators and relations, word problems (20M05) Semigroups in automata theory, linguistics, etc. (20M35)

Related Items (5)

SOME EXACT SEQUENCES FOR THE HOMOTOPY (BI-)MODULE OF A MONOID ⋮ Complexity, combinatorial group theory and the language of palutators ⋮ Markov semigroups, monoids and groups ⋮ NONCOMMUTATIVE GRÖBNER BASES FOR THE COMMUTATOR IDEAL ⋮ Automatic presentations for semigroups.

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• A note on a special one-rule semi-Thue system
• A finite Thue system with decidable word problem and without equivalent finite canonical system
• Complete semi-Thue systems for abelian groups
• Word problems and a homological finiteness condition for monoids
• New decision algorithms for finitely presented commutative semigroups
• Presentations of groups and monoids

This page was built for publication: Commutative monoids have complete presentations by free (non-commutative) monoids