DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS

DOI10.1142/S0218196709005366zbMath1201.20055OpenAlexW2077845820MaRDI QIDQ3643581

Alan J. Cain, Victor Maltcev

Publication date: 9 November 2009

Published in: International Journal of Algebra and Computation (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1142/s0218196709005366

zbMATH Keywords

undecidabilitydecision problemsfinitely presented semigroupssemigroup presentationsMarkov propertiesundecidable problems

Mathematics Subject Classification ID

General structure theory for semigroups (20M10) Free semigroups, generators and relations, word problems (20M05) Word problems, etc. in computability and recursion theory (03D40)

Related Items (3)

Decidability and independence of conjugacy problems in finitely presented monoids ⋮ Finite semigroups embed in finitely presented congruence-free monoids. ⋮ The word problem for one-relation monoids: a survey

Cites Work

• Unnamed Item
• On the geometry of semigroup presentations
• Conjugacy in special monoids
• On monoids presented by a single relation
• Das Identitätsproblem für Gruppen mit einer definierenden Relation
• A complete rewrite system and normal forms for \((S)_{\text{reg}}\)
• Left-divisibility and word problems in single relation monoids
• ON THE CONJUGACY PROBLEM FOR ONE-RELATOR MONOIDS WITH ELEMENTS OF FINITE ORDER
• Generators and relations of direct products of semigroups
• SUBSEMIGROUPS OF THE BICYCLIC MONOID
• Recursive Unsolvability of a problem of Thue
• On one-relator monoids and one-relator groups

This page was built for publication: DECISION PROBLEMS FOR FINITELY PRESENTED AND ONE-RELATION SEMIGROUPS AND MONOIDS