Stuart W. Margolis

Affiliations:
  • Bar-Ilan University, Ramat Gan, Israel


According to our database1, Stuart W. Margolis authored at least 24 papers between 1982 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
Degree 2 transformation semigroups as continuous maps on graphs: Complexity and examples.
Int. J. Algebra Comput., 2023

2021
Degree 2 transformation semigroups as continuous maps on graphs: Foundations and structure.
Int. J. Algebra Comput., 2021

2020
Truncated boolean representable simplicial complexes.
Int. J. Algebra Comput., 2020

2018
The lattice of flats of a boolean representable simplicial complex.
Int. J. Algebra Comput., 2018

2017
On the topology of a boolean representable simplicial complex.
Int. J. Algebra Comput., 2017

2005
The pseudovariety of semigroups of triangular matrices over a finite field.
RAIRO Theor. Informatics Appl., 2005

2004
Words Guaranteeing Minimum Image.
Int. J. Found. Comput. Sci., 2004

Introduction.
Int. J. Algebra Comput., 2004

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

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

2001
Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata.
Int. J. Algebra Comput., 2001

2000
PSPACE-complete problems for subgroups of free groups and inverse finite automata.
Theor. Comput. Sci., 2000

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

Words Guaranteeing Minimal Image.
Proceedings of the International Colloquium on Words, 2000

1999
On the Word Problem for Tensor Products and Amalgams of Monoids.
Int. J. Algebra Comput., 1999

1996
On the Indecomposibility of Certain Language Classes.
Proceedings of the Fourth Israel Symposium on Theory of Computing and Systems, 1996

1994
The Word Problem for Inverse Monoids Presented by One Idempotent Relator.
Theor. Comput. Sci., 1994

PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.
Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

1993
Free Inverse Monoids and Graph immersions.
Int. J. Algebra Comput., 1993

1991
Ash's Type II Theorem, Profinite Topology and Malcev Products: Part I.
Int. J. Algebra Comput., 1991

1985
Products of group languages.
Proceedings of the Fundamentals of Computation Theory, 1985

1984
Languages and Inverse Semigroups.
Proceedings of the Automata, 1984

1983
On the Group Complexity of a Finite Language.
Proceedings of the Automata, 1983

1982
On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code.
Theor. Comput. Sci., 1982


  Loading...