| 2004 |
|---|
| 13 | EE | Stuart W. Margolis,
Benjamin Steinberg:
Introduction.
IJAC 14(5-6): (2004) |
| 12 | EE | Manuel Delgado,
Vítor H. Fernandes,
Stuart W. Margolis,
Benjamin Steinberg:
On Semigroups Whose Idempotent-Generated Subsemigroup is Aperiodic.
IJAC 14(5-6): 655-665 (2004) |
| 11 | EE | Stuart W. Margolis,
Jean-Eric Pin,
Mikhail V. Volkov:
Words Guaranteeing Minimum Image.
Int. J. Found. Comput. Sci. 15(2): 259-276 (2004) |
| 2002 |
|---|
| 10 | EE | Manuel Delgado,
Stuart W. Margolis,
Benjamin Steinberg:
Combinatorial Group Theory, Inverse Monoids, Automata, And Global Semigroup Theory.
IJAC 12(1-2): 179-211 (2002) |
| 2001 |
|---|
| 9 | EE | Stuart W. Margolis,
Mark V. Sapir,
Pascal Weil:
Closed Subgroups in Pro-V Topologies and the Extension Problem for Inverse Automata.
IJAC 11(4): 405-446 (2001) |
| 2000 |
|---|
| 8 | EE | Jean-Camille Birget,
Stuart W. Margolis,
John C. Meakin,
Pascal Weil:
PSPACE-complete problems for subgroups of free groups and inverse finite automata.
Theor. Comput. Sci. 242(1-2): 247-281 (2000) |
| 1996 |
|---|
| 7 | | Stuart W. Margolis,
Mark V. Sapir,
Pascal Weil:
On the Indecomposibility of Certain Language Classes.
ISTCS 1996: 129-134 |
| 1994 |
|---|
| 6 | | Jean-Camille Birget,
Stuart W. Margolis,
John C. Meakin,
Pascal Weil:
PSPACE-Completeness of Certain Algorithmic Problems on the Subgroups of Free Groups.
ICALP 1994: 274-285 |
| 5 | | Jean-Camille Birget,
Stuart W. Margolis,
John C. Meakin:
The Word Problem for Inverse Monoids Presented by One Idempotent Relator.
Theor. Comput. Sci. 123(2): 273-289 (1994) |
| 1985 |
|---|
| 4 | | Stuart W. Margolis,
Jean-Eric Pin:
Products of group languages.
FCT 1985: 285-299 |
| 1984 |
|---|
| 3 | | Stuart W. Margolis,
Jean-Eric Pin:
Languages and Inverse Semigroups.
ICALP 1984: 337-346 |
| 1983 |
|---|
| 2 | | Evelyne Barbin-Le Rest,
Stuart W. Margolis:
On the Group Complexity of a Finite Language.
ICALP 1983: 433-444 |
| 1982 |
|---|
| 1 | | Stuart W. Margolis:
On the Syntactic Transformation Semigroup of a Language Generated by a Finite Biprefix Code.
Theor. Comput. Sci. 21: 225-230 (1982) |
