An upper bound for the power pseudovariety \(\mathbf{PCS}\).
DOI10.1007/S00605-011-0285-5zbMath1255.20051OpenAlexW2050573656MaRDI QIDQ431180
Publication date: 26 June 2012
Published in: Monatshefte für Mathematik (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00605-011-0285-5
completely simple semigroupspower semigroupspseudoidentitiesaggregates of block groupsMal'cev products of pseudovarietiespower pseudovarietiespseudovarieties of finite semigroups
Semigroups of transformations, relations, partitions, etc. (20M20) Varieties and pseudovarieties of semigroups (20M07) Representation of semigroups; actions of semigroups on sets (20M30)
Related Items (1)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Categories as algebra: An essential ingredient in the theory of monoids
- Reduction theorem for the type-II conjecture for finite monoids
- A note on the power semigroup of a completely simple semigroup.
- A constructive version of the Ribes-Zalesskiĭ product theorem.
- Finite aperiodic semigroups with commuting idempotents and generalizations
- Varieties of finite supersolvable groups with the M.~Hall property.
- Constructing divisions into power groups
- Finite state automata: A geometric approach
- INEVITABLE GRAPHS: A PROOF OF THE TYPE II CONJECTURE AND SOME RELATED DECISION PROCEDURES
- A Conjecture on the Hall Topology for the Free Group
- ASH'S TYPE II THEOREM, PROFINITE TOPOLOGY AND MALCEV PRODUCTS: PART I
- On The Profinite Topology on a Free Group
- The geometry of profinite graphs with applications to free groups and finite monoids
- On power groups and embedding theorems for relatively free profinite monoids
- POLYNOMIAL CLOSURE AND TOPOLOGY
- INEVITABLE GRAPHS AND PROFINITE TOPOLOGIES: SOME SOLUTIONS TO ALGORITHMIC PROBLEMS IN MONOID AND AUTOMATA THEORY, STEMMING FROM GROUP THEORY
- A note on the equation \(\mathbf{PH}={\mathbf J}*{\mathbf H}\)
- Inverse automata and profinite topologies on a free group
This page was built for publication: An upper bound for the power pseudovariety \(\mathbf{PCS}\).
