Proof of the fundamental Lemma of complexity (strong version) for arbitrary finite semigroups
- 31 March 1974
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 16 (2) , 209-214
- https://doi.org/10.1016/0097-3165(74)90045-4
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Proof of the Fundamental Lemma of Complexity (weak version) for arbitrary finite semigroupsJournal of Combinatorial Theory, Series A, 1971
- Complexity of Finite SemigroupsAnnals of Mathematics, 1968
- The fundamental lemma of complexity for arbitrary finite semigroupsBulletin of the American Mathematical Society, 1968
- Algebraic theory of machines. I. Prime decomposition theorem for finite semigroups and machinesTransactions of the American Mathematical Society, 1965