Reduction theorem for the type-II conjecture for finite monoids
From MaRDI portal
Publication:805745
DOI10.1016/0022-4049(90)90048-MzbMath0729.20026WikidataQ122965850 ScholiaQ122965850MaRDI QIDQ805745
Karsten Henckell, John L. Rhodes
Publication date: 1990
Published in: Journal of Pure and Applied Algebra (Search for Journal in Brave)
Related Items
An upper bound for the power pseudovariety \(\mathbf{PCS}\)., New results on the conjecture of Rhodes and on the topological conjecture, Type-II conjecture is true for finite \(\mathcal J\)-trivial monoids, John Rhodes and the theory of finite semigroups.
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Almost finite expansions of arbitrary semigroups
- Unsolvability of the universal theory of finite groups
- Decidability of complexity one-half for finite semigroups
- Improved lower bounds for the complexity of finite semigroups
- Semigroups whose idempotents form a subsemigroup
- A topological approach to a conjecture of Rhodes
- On finite 0-simple semigroups and graph theory