Kernel systems - a global study of homomorphisms on finite semigroups

DOI10.1016/0021-8693(77)90265-4zbMath0379.20054OpenAlexW1981684679MaRDI QIDQ1247497

K. Appert

Publication date: 1977

Published in: Journal of Algebra (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0021-8693(77)90265-4

Mathematics Subject Classification ID

Mappings of semigroups (20M15)

Related Items (16)

ON HYPERDECIDABLE PSEUDOVARIETIES OF SIMPLE SEMIGROUPS ⋮ Subsemigroups and complexity via the presentation lemma ⋮ SOLVABLE MONOIDS WITH COMMUTING IDEMPOTENTS ⋮ On the Dowling and Rhodes lattices and wreath products ⋮ Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples ⋮ An upper bound for the complexity of transformation semigroups ⋮ On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarieties. ⋮ Decidability of complexity one-half for finite semigroups ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ ON SEMIGROUPS WHOSE IDEMPOTENT-GENERATED SUBSEMIGROUP IS APERIODIC ⋮ A reduction theorem for complexity of finite semigroups ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ Categories as algebra: An essential ingredient in the theory of monoids ⋮ On the equation \({\mathbf V}*{\mathbf G}={\mathcal E}{\mathbf V}\) ⋮ COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY ⋮ ON ITERATED MAL'CEV PRODUCTS WITH A PSEUDOVARIETY OF GROUPS

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• A reduction theorem for complexity of finite semigroups
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Some results on finite semigroups
• Decomposition and complexity of finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Improved lower bounds for the complexity of finite semigroups
• Lower bounds for complexity of finite semigroups
• On the structure of semigroups
• On finite 0-simple semigroups and graph theory
• The fundamental lemma of complexity for arbitrary finite semigroups
• A homomorphism theorem for finite semigroups

This page was built for publication: Kernel systems - a global study of homomorphisms on finite semigroups