We stand with Ukraine

We stand with Ukraine

John L. Rhodes

Affiliations:

University of California, Berkeley, USA

According to our database¹, John L. Rhodes authored at least 42 papers between 1965 and 2023.

Collaborative distances:

Dijkstra number² of four.
Erdős number³ of three.

Timeline

Legend:

Book

In proceedings

Article

PhD thesis

Dataset

Other

Links

Online presence:

On csauthors.net:

Bibliography

2023

Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples.

[BibT_eX]

[DOI]

Stuart W. Margolis

,

Int. J. Algebra Comput., 2023

2022

Upper Bounds on Mixing Time of Finite Markov Chains.

[BibT_eX]

[DOI]

,

SIAM J. Discret. Math., December, 2022

Holonomy theorem for finite semigroups.

[BibT_eX]

[DOI]

,

,

Int. J. Algebra Comput., 2022

2021

Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure.

[BibT_eX]

[DOI]

Stuart W. Margolis

,

Int. J. Algebra Comput., 2021

2020

Truncated boolean representable simplicial complexes.

[BibT_eX]

[DOI]

Stuart W. Margolis

,

,

Int. J. Algebra Comput., 2020

2019

Normal distributions of finite Markov chains.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2019

Join irreducible semigroups.

[BibT_eX]

[DOI]

Edmond W. H. Lee

,

,

Benjamin Steinberg

Int. J. Algebra Comput., 2019

2018

The lattice of flats of a boolean representable simplicial complex.

[BibT_eX]

[DOI]

Stuart W. Margolis

,

,

Int. J. Algebra Comput., 2018

2017

On the topology of a boolean representable simplicial complex.

[BibT_eX]

[DOI]

Stuart W. Margolis

,

,

Int. J. Algebra Comput., 2017

On the atoms of algebraic lattices arising in 픮-theory.

[BibT_eX]

[DOI]

Attila Egri-Nagy

,

,

,

Benjamin Steinberg

Int. J. Algebra Comput., 2017

2016

The semaphore codes attached to a Turing machine via resets and their various limits.

[BibT_eX]

[DOI]

,

,

Int. J. Algebra Comput., 2016

Random walks on semaphore codes and delay de Bruijn semigroups.

[BibT_eX]

[DOI]

,

,

Int. J. Algebra Comput., 2016

2015

A new notion of vertex independence and rank for finite graphs.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2015

2012

Further Results on Monoids Acting on Trees.

[BibT_eX]

[DOI]

,

Int. J. Algebra Comput., 2012

2011

Geometric Semigroup Theory

[BibT_eX]

[DOI]

,

,

Benjamin Steinberg

CoRR, 2011

2010

Bret Tilson: his Life and Work.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 2010

Aperiodic Pointlikes and Beyond.

[BibT_eX]

[DOI]

Karsten Henckell

,

,

Benjamin Steinberg

Int. J. Algebra Comput., 2010

A Profinite Approach to Stable Pairs.

[BibT_eX]

[DOI]

Karsten Henckell

,

,

Benjamin Steinberg

Int. J. Algebra Comput., 2010

2008

Turing machines and bimachines.

[BibT_eX]

[DOI]

,

Theor. Comput. Sci., 2008

Automatic analysis of computation in biochemical reactions.

[BibT_eX]

[DOI]

Attila Egri-Nagy

,

Chrystopher L. Nehaniv

,

,

Maria J. Schilstra

Biosyst., 2008

2006

Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity.

[BibT_eX]

[DOI]

,

Benjamin Steinberg

Int. J. Algebra Comput., 2006

2005

Krohn-Rhodes complexity pseudovarieties are not finitely based.

[BibT_eX]

[DOI]

,

Benjamin Steinberg

RAIRO Theor. Informatics Appl., 2005

2004

Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups.

[BibT_eX]

[DOI]

,

Benjamin Steinberg

Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003

Finite semigroups, feedback, and the Letichevsky criteria on non-empty words in finite automata.

[BibT_eX]

[DOI]

,

Chrystopher L. Nehaniv

,

Theor. Comput. Sci., 2003

2001

Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups.

[BibT_eX]

[DOI]

,

Benjamin Steinberg

Int. J. Algebra Comput., 2001

2000

The Evolution and Understanding of Hierarchical Compleixity in Biology from an Algebraic Perspective.

[BibT_eX]

[DOI]

Chrystopher L. Nehaniv

,

Artif. Life, 2000

1999

Undecidability, Automata, and Pseudovarities of Finite Semigroups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1999

Pointlike Sets, Hyperdecidability and the Identity Problem for Finite Semigroups.

[BibT_eX]

[DOI]

,

Benjamin Steinberg

Int. J. Algebra Comput., 1999

1996

Krohn-Rhodes theory, hierarchies & evolution.

[BibT_eX]

[DOI]

Chrystopher L. Nehaniv

,

Proceedings of the Mathematical Hierarchies and Biology, 1996

1995

Algebraic and Topological Theory of Languages.

[BibT_eX]

[DOI]

,

RAIRO Theor. Informatics Appl., 1995

1992

Undecidability of the Identity Problem for Finite Semigroups.

[BibT_eX]

[DOI]

,

Robert Baldinger

,

J. Symb. Log., 1992

1991

Monoids Acting on Trees: Elliptic and wreath Products and the Holonomy Theorem for Arbitrary Monoids with Applications to Infinite Groups.

[BibT_eX]

[DOI]

Int. J. Algebra Comput., 1991

Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I.

[BibT_eX]

[DOI]

Karsten Henckell

,

Stuart W. Margolis

,

,

Int. J. Algebra Comput., 1991

1984

Algebraic and Topological Theory of Languages and Computation, Part I: Theorems for Arbitrary Labguages Generalizing the Theorems of Eilenberg, Kleene, Schützenberger and Straubing.

[BibT_eX]

[DOI]

Proceedings of the STACS 84, 1984

1974

Proof of the Fundamental Lemma of Complexity (Strong Version) for Arbitrary Finite Semigroups.

[BibT_eX]

[DOI]

J. Comb. Theory, Ser. A, 1974

1967

A Homomorphism Theorem for Finite Semigroups.

[BibT_eX]

[DOI]

Math. Syst. Theory, 1967

Correction: Complexity of Ideals in Finite Semigroups and Finite-State Machines.

[BibT_eX]

[DOI]

,

Richard Mateosian

,

Math. Syst. Theory, 1967

Complexity of Ideals in Finite Semigroups and Finite-State Machines.

[BibT_eX]

[DOI]

,

Richard Mateosian

,

Math. Syst. Theory, 1967

Methods of the Algebraic Theory of Machines. I: Decomposition Theorem for Generalized Machines; Properties Preserved under Series and Parallel Compositions of Machines.

[BibT_eX]

[DOI]

,

Richard Mateosian

,

J. Comput. Syst. Sci., 1967

Algebraic Principles for the Analysis of a Biochemical System.

[BibT_eX]

[DOI]

,

,

J. Comput. Syst. Sci., 1967

1966

Realizing Complex Boolean Functions with Simple Groups

[BibT_eX]

[DOI]

,

,

Inf. Control., April, 1966

1965

Nets of Threshold Elements

[BibT_eX]

[DOI]

,

Inf. Control., December, 1965

Loading...