Decomposition and complexity of finite semigroups
- 1 December 1971
- journal article
- Published by Springer Nature in Semigroup Forum
- Vol. 3 (1) , 189-250
- https://doi.org/10.1007/bf02572961
Abstract
No abstract availableKeywords
This 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
- 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
- Complexity of Finite SemigroupsAnnals of Mathematics, 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
- Complexity of ideals in finite semigroups and finite-state machinesTheory of Computing Systems, 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
- Elementary conceptsPublished by American Mathematical Society (AMS) ,1961