Proof of the Fundamental Lemma of Complexity (weak version) for arbitrary finite semigroups
- 31 January 1971
- journal article
- Published by Elsevier in Journal of Combinatorial Theory, Series A
- Vol. 10 (1) , 22-73
- https://doi.org/10.1016/0097-3165(71)90064-1
Abstract
No abstract availableKeywords
This publication has 5 references indexed in Scilit:
- 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
- Cascade synthesis of finite-state machinesInformation and Control, 1967
- 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