Nets of Threshold Elements - Kenneth Krohn; John Rhodes 001 (Inf. Control., 1965)

Realizing Complex Boolean Functions with Simple Groups - Kenneth Krohn; W. Douglas Maurer; John Rhodes 001 (Inf. Control., 1966)

Algebraic Principles for the Analysis of a Biochemical System. - Kenneth Krohn; Rudolph Langer; John Rhodes 001 (J. Comput. Syst. Sci., 1967)

Methods of the Algebraic Theory of Machines. I: Decomposition Theorem for Generalized Machines; Properties Preserved under Series and Parallel Compositions of Machines. - Kenneth Krohn; Richard Mateosian; John Rhodes 001 (J. Comput. Syst. Sci., 1967)

Complexity of Ideals in Finite Semigroups and Finite-State Machines. - Kenneth Krohn; Richard Mateosian; John Rhodes 001 (Math. Syst. Theory, 1967)

Correction: Complexity of Ideals in Finite Semigroups and Finite-State Machines. - Kenneth Krohn; Richard Mateosian; John Rhodes 001 (Math. Syst. Theory, 1967)

A Homomorphism Theorem for Finite Semigroups. - John Rhodes 001 (Math. Syst. Theory, 1967)

Proof of the Fundamental Lemma of Complexity (Strong Version) for Arbitrary Finite Semigroups. - John Rhodes 001 (J. Comb. Theory A, 1974)

Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing. - John Rhodes 001 (STACS, 1984)

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. - Karsten Henckell; Stuart W. Margolis; Jean-Eric Pin; John Rhodes 001 (Int. J. Algebra Comput., 1991)

Monoids Acting on Trees: Elliptic and wreath Products and the Holonomy Theorem for Arbitrary Monoids with Applications to Infinite Groups. - John Rhodes 001 (Int. J. Algebra Comput., 1991)

Undecidability of the Identity Problem for Finite Semigroups. - Douglas Albert; Robert Baldinger; John Rhodes 001 (J. Symb. Log., 1992)

Algebraic and Topological Theory of Languages. - John Rhodes 001; Pascal Weil (RAIRO Theor. Informatics Appl., 1995)

Krohn-Rhodes theory, hierarchies & evolution. - Chrystopher L. Nehaniv; John L. Rhodes 001 (Mathematical Hierarchies and Biology, 1996)

Pointlike Sets, Hyperdecidability and the Identity Problem for Finite Semigroups. - John L. Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 1999)

Undecidability, Automata, and Pseudovarities of Finite Semigroups. - John Rhodes 001 (Int. J. Algebra Comput., 1999)

The Evolution and Understanding of Hierarchical Compleixity in Biology from an Algebraic Perspective. - Chrystopher L. Nehaniv; John L. Rhodes 001 (Artif. Life, 2000)

Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups. - John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2001)

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata. - Pál Dömösi; Chrystopher L. Nehaniv; John L. Rhodes 001 (Theor. Comput. Sci., 2003)

Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups. - John Rhodes 001; Benjamin Steinberg (LATIN, 2004)

Krohn-Rhodes complexity pseudovarieties are not finitely based. - John Rhodes 001; Benjamin Steinberg (RAIRO Theor. Informatics Appl., 2005)

Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity. - John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2006)

Automatic analysis of computation in biochemical reactions. - Attila Egri-Nagy; Chrystopher L. Nehaniv; John L. Rhodes 001; Maria J. Schilstra (Biosyst., 2008)

Turing machines and bimachines. - John Rhodes 001; Pedro V. Silva (Theor. Comput. Sci., 2008)

A Profinite Approach to Stable Pairs. - Karsten Henckell; John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2010)

Aperiodic Pointlikes and Beyond. - Karsten Henckell; John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2010)

Bret Tilson: his Life and Work. - John Rhodes 001 (Int. J. Algebra Comput., 2010)

Geometric Semigroup Theory - Jon McCammond; John Rhodes 001; Benjamin Steinberg (CoRR, 2011)

Further Results on Monoids Acting on Trees. - John Rhodes 001; Pedro V. Silva (Int. J. Algebra Comput., 2012)

A new notion of vertex independence and rank for finite graphs. - John L. Rhodes 001; Pedro V. Silva (Int. J. Algebra Comput., 2015)

Random walks on semaphore codes and delay de Bruijn semigroups. - John L. Rhodes 001; Anne Schilling; Pedro V. Silva (Int. J. Algebra Comput., 2016)

The semaphore codes attached to a Turing machine via resets and their various limits. - John L. Rhodes 001; Anne Schilling; Pedro V. Silva (Int. J. Algebra Comput., 2016)

On the atoms of algebraic lattices arising in 픮-theory. - Attila Egri-Nagy; Marcel Jackson; John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2017)

On the topology of a boolean representable simplicial complex. - Stuart W. Margolis; John L. Rhodes 001; Pedro V. Silva (Int. J. Algebra Comput., 2017)

The lattice of flats of a boolean representable simplicial complex. - Stuart W. Margolis; John Rhodes 001; Pedro V. Silva (Int. J. Algebra Comput., 2018)

Join irreducible semigroups. - Edmond W. H. Lee; John Rhodes 001; Benjamin Steinberg (Int. J. Algebra Comput., 2019)

Normal distributions of finite Markov chains. - John Rhodes 001; Anne Schilling (Int. J. Algebra Comput., 2019)

Truncated boolean representable simplicial complexes. - Stuart W. Margolis; John Rhodes 001; Pedro V. Silva (Int. J. Algebra Comput., 2020)

Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure. - Stuart W. Margolis; John Rhodes 001 (Int. J. Algebra Comput., 2021)

Holonomy theorem for finite semigroups. - John Rhodes 001; Anne Schilling; Pedro V. Silva (Int. J. Algebra Comput., 2022)

Upper Bounds on Mixing Time of Finite Markov Chains. - John Rhodes 001; Anne Schilling (SIAM J. Discret. Math., 2022)

Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples. - Stuart W. Margolis; John Rhodes 001 (Int. J. Algebra Comput., 2023)