Improved lower bounds for the complexity of finite semigroups
- 30 April 1972
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 2 (1) , 13-71
- https://doi.org/10.1016/0022-4049(72)90022-9
Abstract
No abstract availableThis publication has 10 references indexed in Scilit:
- Proof of the fundamental Lemma of complexity (strong version) for arbitrary finite semigroupsJournal of Combinatorial Theory, Series A, 1974
- Chapter 4. Synthesis of the classical and modern theory of finite semigroupsAdvances in Mathematics, 1973
- 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
- Complexity of Finite SemigroupsAnnals of Mathematics, 1968
- The fundamental lemma of complexity for arbitrary finite semigroupsBulletin of the American Mathematical Society, 1968
- Some results on finite semigroupsJournal of Algebra, 1966
- Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machinesTransactions of the American Mathematical Society, 1965
- Embedding Theorems for SemigroupsJournal of the London Mathematical Society, 1960