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

DOI10.1016/0097-3165(71)90064-1MaRDI QIDQ2553689zbMATH OpenOpenAlexWikidataFDO

Authors 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)

Cites work

• scientific article; zbMATH DE number 3287733 (Why is no real title available?)
• A homomorphism theorem for finite semigroups
• Algebraic Theory of Machines. I. Prime Decomposition Theorem for Finite Semigroups and Machines
• Cascade synthesis of finite-state machines
• Some results on finite semigroups
• The fundamental lemma of complexity for arbitrary finite semigroups

Cited in

(11)

• The group-theoretic complexity of subsemigroups of Boolean matrices
• Improved lower bounds for the complexity of finite semigroups
• On the complexity of finite semigroups
• Kernel systems - a global study of homomorphisms on finite semigroups
• Complexity of ideals in finite semigroups and finite-state machines
• The fundamental lemma of complexity for arbitrary finite semigroups
• Decomposition and complexity of finite semigroups
• An effective lower bound for group complexity of finite semigroups and automata
• The kernel of a homomorphism on a finite semigroup
• Proof of the fundamental lemma of complexity (strong version) for arbitrary finite semigroups
• Finite binary relations have no more complexity than finite functions

This page was built for publication: Proof of the fundamental lemma of complexity (weak version) for arbitrary finite semigroups

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2553689)