Equations on the semidirect product of a finite semilattice by a -trivial monoid of height
F. Blanchet-Sadri (1995)
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
Similarity:
Displaying similar documents to “How much semigroup structure is needed to encode graphs ?”
Equations on the semidirect product of a finite semilattice by a -trivial monoid of height
On universality of semigroup varieties
Marie Demlová, Václav Koubek (2006)
Archivum Mathematicum
Similarity:
A category is called -determined if every set of non-isomorphic -objects such that their endomorphism monoids are isomorphic has a cardinality less than . A quasivariety is called -universal if the lattice of all subquasivarieties of any quasivariety of finite type is a homomorphic image of a sublattice of the lattice of all subquasivarieties of . We say that a variety is var-relatively alg-universal if there exists a proper subvariety of such that homomorphisms of whose...
A multiplication of e-varieties of regular -solid semigroups by inverse semigroup varieties
Martin Kuřil (1997)
Archivum Mathematicum
Similarity:
A multiplication of e-varieties of regular -solid semigroups by inverse semigroup varieties is described both semantically and syntactically. The associativity of the multiplication is also proved.
On permutability in semigroup varieties
Bedřich Pondělíček (1991)
Mathematica Bohemica
Similarity:
The paper contains characterizations of semigroup varieties whose semigroups with one generator (two generators) are permutable. Here all varieties of regular -semigroups are described in which each semigroup with two generators is permutable.