Subsemigroups and complexity via the Presentation Lemma
Authors:
- Chrystopher NehanivCNChrystopher Nehaniv
- John RhodesJRJohn Rhodes
- 1 June 1995
- journal article
- Published by Elsevier in Journal of Pure and Applied Algebra
- Vol. 101 (3) , 245-289
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Pointlike sets: the finest aperiodic cover of a finite semigroupJournal of Pure and Applied Algebra, 1988
- Categories as algebra: An essential ingredient in the theory of monoidsJournal of Pure and Applied Algebra, 1987
- Kernel systems—A global study of homomorphisms on finite semigroupsJournal of Algebra, 1977
- Chapter 3. Complexity of two-J class semigroupsAdvances in Mathematics, 1973