Results 61 to 70 of about 468 (134)
Let S be a semigroup, C(S) the automaton constructed from the right Cayley graph of S with respect to all of S as the generating set and ∑(C(S)) the automaton semigroup constructed from C(S). Such semigroups are termed Cayley automaton semigroups. For
McLeman, Alexander Lewis Andrew
core
Clifford congruences on generalized quasi-orthodox GV-semigroups
A semigroup S is said to be completely π-regular if for any a ∈ S there exists a positive integer n such that aⁿ is completely regular. A completely π-regular semigroup S is said to be a GV-semigroup if all the regular elements of S are completely ...
Maity, Sunil
core +1 more source
Classification and enumeration of finite semigroups
The classification of finite semigroups is difficult even for small orders because of their large number. Most finite semigroups are nilpotent of nilpotency rank 3.
Distler, Andreas
core
On right inverse ordered semigroups
A regular ordered semigroup $S$ is called right inverse if every principal left ideal of $S$ is generated by an \( \mathcal{R} \)-unique positive element of it. We prove that a regular ordered semigroup is right inverse if and only if any two inverses of
Amlan Jamadar +3 more
core +1 more source
It is well known that a semigroup S is a Clifford semigroup if and only if S is a strong semilattice of groups. We have recently extended this important result from semigroups to semirings by showing that a semiring S is a Clifford semiring if and only ...
Sen, Mridul +2 more
core +1 more source
Maximal Clifford Semigroups of Matrices
All maximal Clifford semigroups of matrices are identified up to isomorphism. If the ground field of the matrices is finite, then there exists a unique Clifford semigroup of maximum ...
Lee, Edmond W. H.
core
On cardinal invariants and metrizability of topological inverse Clifford semigroups
Let S be a compact topological inverse Clifford semigroup S such that the maximal semilattice E and all maximal groups of S are metrizable. We prove that S is first countable and has countable cellularity; moreover, S is metrizable, provided one of the ...
Banakh, Taras
core +1 more source
On special Rees matrix semigroups over semigroups
summary:We study the right regular representation of special Rees matrix semigroups over semigroups, and discuss their embedding in idempotent-free left simple ...
Tóth, Csaba, Nagy, Attila
core +1 more source
Boolean Congruence Lattices of Orthodox Semigroups
The problem of characterizing the semigroups with Boolean congruence lattices has been solved for several classes of semigroups. Hamilton [9] and the author of this paper [1] studied the question for semilattices.
Karl Auinger
core +1 more source
In this thesis we consider in detail the following two fundamental problems for semigroup presentations: 1. Given a semigroup find a presentation defining it. 2. Given a presentation describe the semigroup defined by it.
Ruškuc, Nik
core

