The concepts of ∗-relation of a (Γ-)semigroup and Γ̄-adequate transversal of a (Γ-)abundant semigroup are defined in this note. Then we develop a matrix type theory for abundant semigroups. We give some equivalent conditions of a Rees matrix semigroup being abundant and some equivalent conditions of an abundant Rees matrix semigroup having an adequate transversal. Then we obtain some Rees matrix...

In a previous paper, the author has introduced a number of homomorphisms of an arbitrary semigroup into the translational hull of certain Rees matrix semigroups or orthogonal sums thereof. For regular semigroups, it is proved here that all of these homomorphisms have the property that the image is a densely embedded subsemigroup, i.e., is a densely embedded ideal of its idealizer, and that the ...

We study the relationship between the loop problem of a semigroup, and that of a Rees matrix construction (with or without zero) over the semigroup. This allows us to characterize exactly those completely zero-simple semigroups for which the loop problem is context-free. We also establish some results concerning loop problems for subsemigroups and Rees quotients.

This paper introduces the topological finiteness condition finite derivation type (FDT) on the class of semigroups. This notion is naturally extended from the monoid case. With this new concept we are able to prove that if a Rees matrix semigroupM[S; I, J ;P ] has FDT then the semigroup S also has FDT. Given a monoid S and a finitely presented Rees matrix semigroup M[S; I, J ;P ] we prove that ...

In this paper we give a partial answer to the following question: does a large subsemigroup of a semigroup S with the finite combinatorial property finite derivation type (FDT ) also has the same property? A positive answer is given for large ideals. As a consequence of this statement we prove that, given a finitely presented Rees matrix semigroup M [S; I, J ;P ], the semigroup S has FDT if and...

Fix a finite semigroup S and let a1, . . . , ak , b be tuples in a direct power S. The subpower membership problem (SMP) for S asks whether b can be generated by a1, . . . , ak. For combinatorial Rees matrix semigroups we establish a dichotomy result: if the corresponding matrix is of a certain form, then the SMP is in P; otherwise it is NP-complete. For combinatorial Rees matrix semigroups wit...

We survey results concerning automatic structures for semigroup constructions, providing references and describing the corresponding automatic structures. The constructions we consider are: free products, direct products, Rees matrix semigroups, Bruck-Reilly extensions and wreath products.

We consider various decision problems for automatic semigroups, which involve the provision of an automatic structure as part of the problem instance. With mild restrictions on the automatic structure, which are necessary to make the problem well defined, the uniform word problem for semigroups described by automatic structures is decidable. Under the same conditions, we show that one can also ...

We prove that given a finite (zero) exact right decomposition (M, T ) of a semigroup S, if M is defined by a finite complete presentation then S is also defined by a finite complete presentation. Exact right decompositions are natural generalizations to semigroups of coset decompositions in groups. As a consequence we deduce that the Zappa-Szép extension of a monoid defined by a finite complete...