On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)
From MaRDI portal
Publication:5956869
DOI10.1016/S0022-4049(01)00010-XzbMath0997.20053MaRDI QIDQ5956869
Publication date: 13 August 2002
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
finite groupssemidirect productsfinite semigroupspseudovarieties of semigroupslocally trivial pseudovarieties
Related Items (6)
SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS ⋮ The \(\mathbf G\)-exponent of a pseudovariety of semigroups ⋮ THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\mathsf{DA}$ ⋮ ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC ⋮ THE GLOBALS OF SOME SUBPSEUDOVARIETIES OF $\mathsf{DA}$ ⋮ A syntactic approach to covers for E ‐dense semigroups over group varieties
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Generalized varieties of commutative and nilpotent semigroups
- Pseudovarieties, generalized varieties and similarly described classes
- The Birkhoff theorem for finite algebras
- Kernel systems - a global study of homomorphisms on finite semigroups
- Profinite categories and semidirect products
- The bifree regular \(E\)-solid semigroups
- Locality of DS and associated varieties
- Profinite categories, implicit operations and pseudovarieties of categories
- An infinite order operator on the lattice of varieties of completely regular semigroups
- Semigroups whose idempotents form a subsemigroup
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- On The Profinite Topology on a Free Group
- Semidirect products of regular semigroups
- On the Decidability of Iterated Semidirect Products with Applications to Complexity
- HYPERDECIDABLE PSEUDOVARIETIES AND THE CALCULATION OF SEMIDIRECT PRODUCTS
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- ON THE HYPERDECIDABILITY OF PSEUDOVARIETIES OF GROUPS
- A SYNTACTICAL PROOF OF LOCALITY OF DA
- Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
- The free completely regular semigroup on a set
This page was built for publication: On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\)