default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDJohn L. Rhodes 0001
Person information
- affiliation: University of California, Berkeley, USA
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
[j38]Stuart W. Margolis, John Rhodes:
Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples. Int. J. Algebra Comput. 33(2): 289-316 (2023)- 2022
- [j37]John Rhodes, Anne Schilling
, Pedro V. Silva:
Holonomy theorem for finite semigroups. Int. J. Algebra Comput. 32(3): 443-460 (2022) - [j36]John Rhodes, Anne Schilling:
Upper Bounds on Mixing Time of Finite Markov Chains. SIAM J. Discret. Math. 36(4): 3031-3057 (2022) - 2021
- [j35]Stuart W. Margolis, John Rhodes:
Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure. Int. J. Algebra Comput. 31(6): 1065-1091 (2021) - 2020
- [j34]Stuart W. Margolis, John Rhodes, Pedro V. Silva:
Truncated boolean representable simplicial complexes. Int. J. Algebra Comput. 30(07): 1399-1435 (2020)
2010 – 2019
- 2019
- [j33]Edmond W. H. Lee, John Rhodes, Benjamin Steinberg:
Join irreducible semigroups. Int. J. Algebra Comput. 29(7): 1249-1310 (2019) - [j32]John Rhodes, Anne Schilling:
Normal distributions of finite Markov chains. Int. J. Algebra Comput. 29(8): 1431-1449 (2019) - 2018
- [j31]Stuart W. Margolis, John Rhodes, Pedro V. Silva:
The lattice of flats of a boolean representable simplicial complex. Int. J. Algebra Comput. 28(8): 1677-1691 (2018) - 2017
- [j30]Stuart W. Margolis, John L. Rhodes, Pedro V. Silva:
On the topology of a boolean representable simplicial complex. Int. J. Algebra Comput. 27(1): 121-156 (2017) - [j29]Attila Egri-Nagy, Marcel Jackson, John Rhodes, Benjamin Steinberg:
On the atoms of algebraic lattices arising in 픮-theory. Int. J. Algebra Comput. 27(2): 157-188 (2017) - [i3]Edmond W. H. Lee, John L. Rhodes, Benjamin Steinberg:
Join irreducible semigroups. CoRR abs/1702.03753 (2017) - 2016
- [j28]John L. Rhodes, Anne Schilling, Pedro V. Silva:
Random walks on semaphore codes and delay de Bruijn semigroups. Int. J. Algebra Comput. 26(4): 635-673 (2016) - [j27]John L. Rhodes, Anne Schilling, Pedro V. Silva:
The semaphore codes attached to a Turing machine via resets and their various limits. Int. J. Algebra Comput. 26(4): 675-704 (2016) - 2015
- [j26]John L. Rhodes, Pedro V. Silva:
A new notion of vertex independence and rank for finite graphs. Int. J. Algebra Comput. 25(1-2): 123-167 (2015) - 2012
- [j25]John Rhodes, Pedro V. Silva:
Further Results on Monoids Acting on Trees. Int. J. Algebra Comput. 22(4) (2012) - [i2]John Rhodes, Pedro V. Silva:
A new notion of vertex independence and rank for finite graphs. CoRR abs/1201.3984 (2012) - 2011
- [i1]Jon McCammond, John Rhodes, Benjamin Steinberg:
Geometric Semigroup Theory. CoRR abs/1104.2301 (2011) - 2010
- [j24]Karsten Henckell, John Rhodes, Benjamin Steinberg:
A Profinite Approach to Stable Pairs. Int. J. Algebra Comput. 20(2): 269-285 (2010) - [j23]Karsten Henckell, John Rhodes, Benjamin Steinberg:
Aperiodic Pointlikes and Beyond. Int. J. Algebra Comput. 20(2): 287-305 (2010) - [j22]John Rhodes:
Bret Tilson: his Life and Work. Int. J. Algebra Comput. 20(2) (2010)
2000 – 2009
- 2008
- [j21]Attila Egri-Nagy, Chrystopher L. Nehaniv, John L. Rhodes, Maria J. Schilstra:
Automatic analysis of computation in biochemical reactions. Biosyst. 94(1-2): 126-134 (2008) - [j20]John Rhodes, Pedro V. Silva:
Turing machines and bimachines. Theor. Comput. Sci. 400(1-3): 182-224 (2008) - 2006
- [j19]John Rhodes, Benjamin Steinberg:
Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity. Int. J. Algebra Comput. 16(4): 739-748 (2006) - 2005
- [j18]John Rhodes, Benjamin Steinberg:
Krohn-Rhodes complexity pseudovarieties are not finitely based. RAIRO Theor. Informatics Appl. 39(1): 279-296 (2005) - 2004
- [c3]John Rhodes, Benjamin Steinberg:
Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups. LATIN 2004: 279-291 - 2003
- [j17]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
- [j16]John Rhodes, Benjamin Steinberg:
Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups. Int. J. Algebra Comput. 11(6): 627-672 (2001) - 2000
- [j15]Chrystopher L. Nehaniv, John L. Rhodes:
The Evolution and Understanding of Hierarchical Compleixity in Biology from an Algebraic Perspective. Artif. Life 6(1): 45-67 (2000)
1990 – 1999
- 1999
- [j14]John Rhodes:
Undecidability, Automata, and Pseudovarities of Finite Semigroups. Int. J. Algebra Comput. 9(3-4): 455-474 (1999) - [j13]John L. Rhodes, Benjamin Steinberg:
Pointlike Sets, Hyperdecidability and the Identity Problem for Finite Semigroups. Int. J. Algebra Comput. 9(3-4): 475-482 (1999) - 1996
- [c2]Chrystopher L. Nehaniv, John L. Rhodes:
Krohn-Rhodes theory, hierarchies & evolution. Mathematical Hierarchies and Biology 1996: 29-42 - 1995
- [j12]John Rhodes, Pascal Weil:
Algebraic and Topological Theory of Languages. RAIRO Theor. Informatics Appl. 29(1): 1-44 (1995) - 1992
- [j11]Douglas Albert, Robert Baldinger, John Rhodes:
Undecidability of the Identity Problem for Finite Semigroups. J. Symb. Log. 57(1): 179-192 (1992) - 1991
- [j10]John Rhodes:
Monoids Acting on Trees: Elliptic and wreath Products and the Holonomy Theorem for Arbitrary Monoids with Applications to Infinite Groups. Int. J. Algebra Comput. 1(2): 253-280 (1991) - [j9]Karsten Henckell, Stuart W. Margolis, Jean-Eric Pin, John Rhodes:
Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I. Int. J. Algebra Comput. 1(4): 411-436 (1991)
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 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. Math. Syst. Theory 1(1): 59-66 (1967) - [j4]John Rhodes:
A Homomorphism Theorem for Finite Semigroups. Math. Syst. Theory 1(4): 289-304 (1967) - [j3]Kenneth Krohn, Richard Mateosian, John Rhodes:
Correction: Complexity of Ideals in Finite Semigroups and Finite-State Machines. Math. Syst. Theory 1(4): 373 (1967) - 1966
- [j2]Kenneth Krohn, W. D. Maurer, John Rhodes:
Realizing Complex Boolean Functions with Simple Groups. Inf. Control. 9(2): 190-195 (1966) - 1965
- [j1]Kenneth Krohn, John Rhodes:
Nets of Threshold Elements. Inf. Control. 8(6): 579-588 (1965)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-10-07 22:19 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
