On finitely recognizable semigroups

\(\mathcal J\)-depth function Burnside varieties decomposition theorem finite \(\mathcal J\)-above semigroups finitely based variety finitely generated finitely presented finitely recognizable semigroups solvable word problem

Mathematics Subject Classification ID

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

Review text

We analyze some algebraic properties of semigroups whose finite subsets are recognizable (finitely recognizable semigroups). We show that these semigroups are stable and their subgroups are of finite order. As a consequence of this we prove an interesting decomposition theorem for finitely recognizable semigroups which are finitely generated. Moreover we give more equivalent characterizations of these semigroups under the additional hypothesis that they have a \(\mathcal J\)-depth function; we show, in particular, that this class of semigroups coincides with the class of finite \(\mathcal J\)-above semigroups. Finally we prove that finitely recognizable semigroups which are finitely presented in a finitely based variety have a solvable word problem.

Recommendations

Cites work

Cited in

(5)

This page was built for publication: On finitely recognizable semigroups

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