Please note: This is a beta version of the new dblp website.
You can find the classic dblp view of this page here.
You can find the classic dblp view of this page here.
John L. Rhodes
John Rhodes
2010 – today
- 2012
[j23]- 2011
[i1]Jon McCammond, John Rhodes, Benjamin Steinberg: Geometric Semigroup Theory. CoRR abs/1104.2301 (2011)- 2010
[j22]Karsten Henckell, John Rhodes, Benjamin Steinberg: A Profinite Approach to Stable Pairs. IJAC 20(2): 269-285 (2010)
[j21]Karsten Henckell, John Rhodes, Benjamin Steinberg: Aperiodic Pointlikes and Beyond. IJAC 20(2): 287-305 (2010)
[j20]
2000 – 2009
- 2008
[j19]Attila Egri-Nagy, Chrystopher L. Nehaniv, John L. Rhodes, Maria J. Schilstra: Automatic analysis of computation in biochemical reactions. Biosystems 94(1-2): 126-134 (2008)
[j18]John Rhodes, Pedro V. Silva: Turing machines and bimachines. Theor. Comput. Sci. 400(1-3): 182-224 (2008)- 2006
[j17]John Rhodes, Benjamin Steinberg: Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity. IJAC 16(4): 739-748 (2006)- 2005
[j16]John Rhodes, Benjamin Steinberg: Krohn-Rhodes complexity pseudovarieties are not finitely based. ITA 39(1): 279-296 (2005)- 2004
[c2]John Rhodes, Benjamin Steinberg: Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups. LATIN 2004: 279-291- 2003
[j15]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
[j14]John Rhodes, Benjamin Steinberg: Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups. IJAC 11(6): 627-672 (2001)- 2000
[j13]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)
1990 – 1999
- 1999
[j12]John Rhodes: Undecidability, Automata, and Pseudovarities of Finite Semigroups. IJAC 9(3-4): 455-474 (1999)
[j11]John L. Rhodes, Benjamin Steinberg: Pointlike Sets, Hyperdecidability and the Identity Problem for Finite Semigroups. IJAC 9(3-4): 475-482 (1999)- 1995
[j10]- 1992
[j9]Douglas Albert, Robert Baldinger, John Rhodes: Undecidability of the Identity Problem for Finite Semigroups. J. Symb. Log. 57(1): 179-192 (1992)
1980 – 1989
- 1984
[c1]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
1970 – 1979
- 1974
[j8]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)
1960 – 1969
- 1967
[j7]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)
[j6]Kenneth Krohn, Rudolph Langer, John Rhodes: Algebraic Principles for the Analysis of a Biochemical System. J. Comput. Syst. Sci. 1(2): 119-136 (1967)
[j5]Kenneth Krohn, Richard Mateosian, John Rhodes: Complexity of Ideals in Finite Semigroups and Finite-State Machines. Mathematical Systems Theory 1(1): 59-66 (1967)
[j4]John Rhodes: A Homomorphism Theorem for Finite Semigroups. Mathematical Systems Theory 1(4): 289-304 (1967)
[j3]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
[j2]Kenneth Krohn, W. D. Maurer, John Rhodes: Realizing Complex Boolean Functions with Simple Groups. Information and Control 9(2): 190-195 (1966)- 1965
[j1]Kenneth Krohn, John Rhodes: Nets of Threshold Elements. Information and Control 8(6): 579-588 (1965)
Coauthor Index
data released under the ODC-BY 1.0 license. See also our legal information page
last updated on 2012-12-13 22:34 CET by the dblp team



