2008 |
17 | EE | John Rhodes,
Pedro V. Silva:
Turing machines and bimachines.
Theor. Comput. Sci. 400(1-3): 182-224 (2008) |
2006 |
16 | EE | John Rhodes,
Benjamin Steinberg:
Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity.
IJAC 16(4): 739-748 (2006) |
2004 |
15 | EE | John Rhodes,
Benjamin Steinberg:
Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups.
LATIN 2004: 279-291 |
2003 |
14 | EE | Pál Dömösi,
Chrystopher L. Nehaniv,
John L. Rhodes:
Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.
Theor. Comput. Sci. 302(1-3): 295-317 (2003) |
2001 |
13 | EE | John Rhodes,
Benjamin Steinberg:
Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups.
IJAC 11(6): 627-672 (2001) |
2000 |
12 | | Chrystopher L. Nehaniv,
John L. Rhodes:
The Evolution and Understanding of Hierarchical Compleixity in Biology from an Algebraic Perspective.
Artificial Life 6(1): 45-67 (2000) |
1995 |
11 | | John Rhodes,
Pascal Weil:
Algebraic and Topological Theory of Languages.
ITA 29(1): 1-44 (1995) |
1992 |
10 | | Douglas Albert,
Robert Baldinger,
John Rhodes:
Undecidability of the Identity Problem for Finite Semigroups.
J. Symb. Log. 57(1): 179-192 (1992) |
1984 |
9 | | John Rhodes:
Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing.
STACS 1984: 299-304 |
1974 |
8 | | John Rhodes:
Proof of the Fundamental Lemma of Complexity (Strong Version) for Arbitrary Finite Semigroups.
J. Comb. Theory, Ser. A 16(2): 209-214 (1974) |
1967 |
7 | | Kenneth Krohn,
Richard Mateosian,
John Rhodes:
Methods of the Algebraic Theory of Machines. I: Decomposition Theorem for Generalized Machines; Properties Preserved under Series and Parallel Compositions of Machines.
J. Comput. Syst. Sci. 1(1): 55-85 (1967) |
6 | | Kenneth Krohn,
Rudolph Langer,
John Rhodes:
Algebraic Principles for the Analysis of a Biochemical System.
J. Comput. Syst. Sci. 1(2): 119-136 (1967) |
5 | | Kenneth Krohn,
Richard Mateosian,
John Rhodes:
Complexity of Ideals in Finite Semigroups and Finite-State Machines.
Mathematical Systems Theory 1(1): 59-66 (1967) |
4 | | John Rhodes:
A Homomorphism Theorem for Finite Semigroups.
Mathematical Systems Theory 1(4): 289-304 (1967) |
3 | | Kenneth Krohn,
Richard Mateosian,
John Rhodes:
Correction: Complexity of Ideals in Finite Semigroups and Finite-State Machines.
Mathematical Systems Theory 1(4): 373 (1967) |
1966 |
2 | | Kenneth Krohn,
W. D. Maurer,
John Rhodes:
Realizing Complex Boolean Functions with Simple Groups
Information and Control 9(2): 190-195 (1966) |
1965 |
1 | | Kenneth Krohn,
John Rhodes:
Nets of Threshold Elements
Information and Control 8(6): 579-588 (1965) |