The Word Problem in the Variety of Inverse Semigroups with Abélian Covers

DOI10.1112/JLMS/53.1.79zbMATH Open0864.20032OpenAlexW2056824334MaRDI QIDQ4894569FDOQ4894569

Authors: J. C. Meakin, Mark Sapir 

Publication date: 18 June 1997

Published in: Journal of the London Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1112/jlms/53.1.79

Recommendations

• The word problem for relatively free semigroups.
• Decidability versus undecidability of the word problem in amalgams of inverse semigroups.
• Algorithmic problems in varieties of semigroups
• The word problem in varieties of semigroups, rings, and Lie algebras

zbMATH Keywords

finite presentationsundecidable word problemvarieties of inverse semigroupspartially recursive functionsMinsky algorithm\(E\)-unitary covers over Abelian groups

Mathematics Subject Classification ID

Free semigroups, generators and relations, word problems (20M05) Varieties and pseudovarieties of semigroups (20M07) Inverse semigroups (20M18)

Cited In (7)

• The uniform word problem for groups and finite Rees quotients of \(E\)-unitary inverse semigroups
• Title not available (Why is that?)
• Inverse monoids: decidability and complexity of algebraic questions.
• ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS
• A problem on the variety of unary inverse semigroups
• Partially commutative inverse monoids.
• Title not available (Why is that?)

This page was built for publication: The Word Problem in the Variety of Inverse Semigroups with Abélian Covers

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4894569)