Algorithmic problems in varieties of semigroups

DOI10.1007/BF01978400zbMath0683.20048OpenAlexW2051408347MaRDI QIDQ1824703

Mark V. Sapir

Publication date: 1988

Published in: Algebra and Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01978400

zbMATH Keywords

finitely presented semigroupssolvable word problemfinitely based nonperiodic variety of semigroupsimbeddable in matrix semigroupssolvable elementary theory

Mathematics Subject Classification ID

Varieties and pseudovarieties of semigroups (20M07) Free semigroups, generators and relations, word problems (20M05) Word problems (aspects of algebraic structures) (08A50)

Related Items (2)

Minsky Machines and Algorithmic Problems ⋮ Algorithmically complex residually finite groups

Cites Work

• Bases for equational theories of semi-groups
• Varieties of groups
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: Algorithmic problems in varieties of semigroups