Abstract:
We give some statements on the structure of finitely generated commutative semigroups which permit us to find necessary and sufficient conditions of isomorphism of two finitely presented commutative semigroups. This part of the article might be of independent interest. However, the main result for us is the recursive equivalence of the following three algorithmic problems: the isomorphism problem for commutative semigroups, the isomorphism problem for regular commutative semigroups and the conjugacy problem for finite sequences of elements in the groups $GL(l,Z)$.
Figures: 1.
Bibliography: 7 titles.
Fulltext:
PDF file (2532 kB)
