Isomorphism problem for semigroups with one defining relation
type: Item
instance of: scholarly article
title: Isomorphism problem for semigroups with one defining relation
zbMATH Open document ID: 0549.20035
DOI: 10.1007/BF01137692
author: G. U. Oganesyan
published in: Mathematical Notes
publication date: 1984-01-01T00:00:00Z
review text: It is proved that there exists an algorithm which solves the word problem for semigroups given by one defining relation of the kind \(a=A\), when a is a letter. The main result is the following theorem. Let \(K\) be the class of semigroups which are given by one defining relation with nonvoid defining words. There exists an algorithm by the help of which we can decide for two arbitrary semigroups in \(K\) whether or not these are isomorphic.
Mathematics Subject Classification ID: 20M05
zbMATH DE Number: 3875540
zbMATH Keywords: word problem
zbMATH Keywords: semigroups
zbMATH Keywords: defining relation
reviewed by: Grigori I. Zhitomirski
MaRDI profile type: Publication
cites work: Q4170913
cites work: Q3953984
cites work: Q5628366
cites work: Q4165508
description: scientific article; zbMATH DE number 3875540