D ec 2 00 8 AN EFFECTIVE LOWER BOUND FOR GROUP COMPLEXITY OF FINITE SEMIGROUPS AND AUTOMATAKARSTEN HENCKELL, JOHN RHODES, BENJAMIN STEINBERG20081 Excerpt

Krohn-Rhodes complexity pseudovarieties are not finitely basedJohn L. Rhodes, Benjamin SteinbergITA2005

Categories as algebra: An essential ingredient in the theory of monoidsB. TilsonJ. Pure and Appl. Algebra1987Highly Influential4 Excerpts

Kernel Systems - A global study of homomorphisms on finite semigroupsJ. RhodesJ. Algebra1977Highly Influential6 Excerpts

Automata, languages, and machines. ASamuel EilenbergPure and applied mathematics1974Highly Influential7 Excerpts

Subsemigroups and complexity via the Presentation LemmaBeverly, Austina, +5 authors Rhodes2003Highly Influential5 Excerpts

On an assertion of J. Rhodes and the finite basis and finite vertex rank problems for pseudovarietiesB. SteinbergJ. Pure Appl. Algebra20041 Excerpt

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part IKarsten Henckell, Stuart W. Margolis, Jean-Éric Pin, John L. RhodesIJAC19915 Excerpts

Inevitable Graphs: a Proof of the Type II Conjecture and some Related Decision ProceduresChristopher J. AshIJAC19913 Excerpts