Benjamin Steinberg

Orcid: 0000-0003-3636-4255

Affiliations:
  • City College of New York, Department of Mathematics, NY, USA


According to our database1, Benjamin Steinberg authored at least 48 papers between 1998 and 2023.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

Online presence:

On csauthors.net:

Bibliography

2023
Comparison of Machine Learning Detection of Low Left Ventricular Ejection Fraction Using Individual ECG Leads.
Proceedings of the Computing in Cardiology, 2023

2021
Pointlike Sets and Separation: A Personal Perspective.
Proceedings of the Developments in Language Theory - 25th International Conference, 2021

2019
Join irreducible semigroups.
Int. J. Algebra Comput., 2019

2018
Lamplighter groups, bireversible automata and rational series over finite rings.
CoRR, 2018

Pointlike sets for varieties determined by groups.
CoRR, 2018

2017
On the atoms of algebraic lattices arising in 픮-theory.
Int. J. Algebra Comput., 2017

Merge decompositions, two-sided Krohn-Rhodes, and aperiodic pointlikes.
CoRR, 2017

Pro-Aperiodic Monoids via Saturated Models.
Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2015
Markov chains, -trivial monoids and representation theory.
Int. J. Algebra Comput., 2015

Rational subsets and submonoids of wreath products.
Inf. Comput., 2015

2013
A categorical invariant of flow equivalence of shifts
CoRR, 2013

Topological dynamics and recognition of languages.
CoRR, 2013

2012
The Krohn-Rhodes Theorem and Local Divisors.
Fundam. Informaticae, 2012

2011
The Černý conjecture for one-cluster automata with prime length cycle.
Theor. Comput. Sci., 2011

Tilings and Submonoids of Metabelian Groups.
Theory Comput. Syst., 2011

The Averaging Trick and the černý Conjecture.
Int. J. Found. Comput. Sci., 2011

Automata over a Binary Alphabet Generating Free Groups of Even Rank.
Int. J. Algebra Comput., 2011

On Iterated Mal'cEV Products with a Pseudovariety of Groups.
Int. J. Algebra Comput., 2011

Geometric Semigroup Theory
CoRR, 2011

2010
A Structural Approach to the Locality of Pseudovarieties of the Form LH (m) V.
Int. J. Algebra Comput., 2010

What are Modules? An Overview of Bret Tilson's Paper "Modules" from a Geometric Viewpoint.
Int. J. Algebra Comput., 2010

Aperiodic Pointlikes and Beyond.
Int. J. Algebra Comput., 2010

A Profinite Approach to Stable Pairs.
Int. J. Algebra Comput., 2010

A Theory of Transformation Monoids: Combinatorics and Representation Theory.
Electron. J. Comb., 2010

The Universal Covering of an Inverse Semigroup.
Appl. Categorical Struct., 2010

2009
Matrix Mortality and the Cerný-Pin Conjecture.
Proceedings of the Developments in Language Theory, 13th International Conference, 2009

2008
Subsequence Counting, Matrix Representations and a Theorem of Eilenberg.
Proceedings of the Language and Automata Theory and Applications, 2008

2007
The submonoid and rational subset membership problems for graph groups.
Proceedings of the LATA 2007. Proceedings of the 1st International Conference on Language and Automata Theory and Applications., 2007

2006
Synchronizing groups and automata.
Theor. Comput. Sci., 2006

Möbius functions and semigroup representation theory.
J. Comb. Theory, Ser. A, 2006

Complexity Pseudovarieties Are not Local: Type Ii Subsemigroups Can Fall Arbitrarily in Complexity.
Int. J. Algebra Comput., 2006

2005
Constructing divisions into power groups.
Theor. Comput. Sci., 2005

Krohn-Rhodes complexity pseudovarieties are not finitely based.
RAIRO Theor. Informatics Appl., 2005

On a Class of Automata Groups Generalizing Lamplighter Groups.
Int. J. Algebra Comput., 2005

2004
An application of a Theorem of Ash to finite covers.
Stud Logica, 2004

Introduction.
Int. J. Algebra Comput., 2004

On Semigroups Whose Idempotent-Generated Subsemigroup is Aperiodic.
Int. J. Algebra Comput., 2004

Join Irreducible Pseudovarieties, Group Mapping, and Kovács-Newman Semigroups.
Proceedings of the LATIN 2004: Theoretical Informatics, 2004

2003
Categories as Algebra, II.
Int. J. Algebra Comput., 2003

2002
Extensions and submonoids of automatic monoids.
Theor. Comput. Sci., 2002

Combinatorial Group Theory, Inverse Monoids, Automata, And Global Semigroup Theory.
Int. J. Algebra Comput., 2002

2001
Inevitable Graphs and Profinite Topologies: Some Solutions to Algorithmic Problems in Monoid and Automata Theory, Stemming from Group Theory.
Int. J. Algebra Comput., 2001

Profinite Semigroups, Varieties, Expansions and the Structure of Relatively Free Profinite Semigroups.
Int. J. Algebra Comput., 2001

2000
Polynomial Closure and Topology.
Int. J. Algebra Comput., 2000

Power Semigroups and Polynomial Closure.
Proceedings of the International Colloquium on Words, 2000

1999
Pointlike Sets, Hyperdecidability and the Identity Problem for Finite Semigroups.
Int. J. Algebra Comput., 1999

1998
Addendum On Pointlike Sets and Joins of Pseudovarieties.
Int. J. Algebra Comput., 1998

On Pointlike Sets and Joins of Pseudovarieties.
Int. J. Algebra Comput., 1998


  Loading...