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

DOI10.1112/jlms/53.1.79zbMath0864.20032OpenAlexW2056824334MaRDI QIDQ4894569

Mark V. Sapir, John C. Meakin

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

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Related Items (3)

Inverse monoids: decidability and complexity of algebraic questions. ⋮ ALGORITHMIC PROBLEMS ON INVERSE MONOIDS OVER VIRTUALLY FREE GROUPS ⋮ Partially commutative inverse monoids.

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