Kernel systems—A global study of homomorphisms on finite semigroups
- 30 November 1977
- journal article
- Published by Elsevier in Journal of Algebra
- Vol. 49 (1) , 1-45
- https://doi.org/10.1016/0021-8693(77)90265-4
Abstract
No abstract availableThis publication has 11 references indexed in Scilit:
- Proof of the fundamental Lemma of complexity (strong version) for arbitrary finite semigroupsJournal of Combinatorial Theory, Series A, 1974
- Chapter 2. Axioms for complexity for all finite semigroupsAdvances in Mathematics, 1973
- Improved lower bounds for the complexity of finite semigroupsJournal of Pure and Applied Algebra, 1972
- Lower bounds for complexity of finite semigroupsJournal of Pure and Applied Algebra, 1971
- Proof of the Fundamental Lemma of Complexity (weak version) for arbitrary finite semigroupsJournal of Combinatorial Theory, Series A, 1971
- On finite 0-simple semigroups and graph theoryTheory of Computing Systems, 1968
- The fundamental lemma of complexity for arbitrary finite semigroupsBulletin of the American Mathematical Society, 1968
- A homomorphism theorem for finite semigroupsTheory of Computing Systems, 1967
- Some results on finite semigroupsJournal of Algebra, 1966
- On the Structure of SemigroupsAnnals of Mathematics, 1951