The fundamental lemma of complexity for arbitrary finite semigroups

DOI10.1090/S0002-9904-1968-12064-6zbMath0185.04801OpenAlexW2132100280WikidataQ124858835 ScholiaQ124858835MaRDI QIDQ5577140

No author found.

Publication date: 1968

Published in: Bulletin of the American Mathematical Society (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1090/s0002-9904-1968-12064-6

zbMATH Keywords

generalized groups, semigroups

Related Items

John Rhodes and the theory of finite semigroups. ⋮ An effective lower bound for group complexity of finite semigroups and automata ⋮ On the complexity of finite semigroups ⋮ Finite binary relations have no more complexity than finite functions ⋮ Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups ⋮ Krohn-Rhodes complexity pseudovarieties are not finitely based ⋮ Kernel systems - a global study of homomorphisms on finite semigroups ⋮ The group-theoretic complexity of subsemigroups of Boolean matrices ⋮ Decomposition and complexity of finite semigroups ⋮ Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups ⋮ Representations of semigroups by linear transformations. I ⋮ COMPLEXITY PSEUDOVARIETIES ARE NOT LOCAL: TYPE II SUBSEMIGROUPS CAN FALL ARBITRARILY IN COMPLEXITY ⋮ Improved lower bounds for the complexity of finite semigroups

Cites Work

• Complexity of finite semigroups
• Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups
• Lower bounds for complexity of finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Characters and complexity of finite semigroups
• A homomorphism theorem for finite semigroups