Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups

DOI10.1016/0097-3165(71)90064-1zbMath0241.20058OpenAlexW2046328068WikidataQ124807123 ScholiaQ124807123MaRDI QIDQ2553689

Yanyan Li

Publication date: 1971

Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/0097-3165(71)90064-1

Mathematics Subject Classification ID

Semigroups of transformations, relations, partitions, etc. (20M20)

Related Items

Complexity of ideals in finite semigroups and finite-state machines ⋮ The fundamental lemma of complexity for arbitrary 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 ⋮ The kernel of a homomorphism on a finite semigroup ⋮ Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups ⋮ 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 ⋮ Improved lower bounds for the complexity of finite semigroups

Cites Work

• Unnamed Item
• Some results on finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• The fundamental lemma of complexity for arbitrary finite semigroups
• A homomorphism theorem for finite semigroups