Skip to main content
Log in

On a conjecture of Rhodes

  • Survey Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  1. C.J. Ash, Finite semigroups with commuting idempotents,J. Austral. Math. Soc. (Series A) 43, 1987.

  2. J.C. Birget, S.W. Margolis and J. Rhodes, Finite semigroups whose idempotents commute or form a subsemigroup,in Semigroups and Their Applications, edited by S.M. Goberstein and P.M. Higgins, Reidel, Dordrecht, 1987, pp. 25–35.

    Google Scholar 

  3. J.C. Birget, S.W. Margolis and J. Rhodes, Finite semigroups whose idempotents form a semilattice or a band. To appear.

  4. S. Eilenberg,Automata, Languages and Machines, Academic Press, New York, vol. A, 1974; Vol B, 1976.

    MATH  Google Scholar 

  5. M. Hall Jr., A topology for free groups and related groups,Ann. of Maths,52, (1950), 127–139.

    Article  Google Scholar 

  6. J. Karnofsky and J. Rhodes, Decidability of complexity one-half for finite semigroups,Semigroup Forum 24 (1982) 55–66

    Article  MATH  MathSciNet  Google Scholar 

  7. G. Lallement,Semigroups and Combinatorial Applications, Wiley, New York, 1979.

    MATH  Google Scholar 

  8. S.W. Margolis and J.E. Pin, Varieties of finite monoids and topology for the free monoid. InProceedings of the Marquette Semigroup Conference, 1984, pp. 113–130.

  9. S.W. Margolis and J.E. Pin, Product of group languages, FCT Conference, Lecture Notes in Computer Science 199 (1985) 285–299.

    MathSciNet  Google Scholar 

  10. S.W. Margolis and J.E. Pin, Inverse semigroups and varieties of finite semigroups,Journal of Algebra 110 (1987) 306–323.

    Article  MATH  MathSciNet  Google Scholar 

  11. J.E. Pin, Finite group topology andp-adic topology for free monoids.12th ICALP, Lecture Notes in Computer Science 199, Springer, Berlin, 1985, pp. 285–299.

    Google Scholar 

  12. J.E. Pin,Varieties of formal languages, North Oxford Academic, London and Plenum, New-York, 1986.

    MATH  Google Scholar 

  13. J.E. Pin, On the languages recognized by finite reversible automata,14th ICALP, Lecture Notes in Computer Science 267 Springer, Berlin, 1987, pp. 237–249.

    Google Scholar 

  14. J.E. Pin, A topological approach to a conjecture of Rhodes. To appear in the Bulletin of the Australian Mathematical Society.

  15. J.E. Pin, Topologies for the free monoid. Submitted.

  16. Ch. Reutenauer, Une topologie du monoïde libre,Semigroup Forum 18 (1979) 33–49.

    Article  MATH  MathSciNet  Google Scholar 

  17. Ch. Reutenauer, Sur mon article “Une topologie du monoïde libre”,Semigroup Forum,22 (1981) 93–95.

    Article  MATH  MathSciNet  Google Scholar 

  18. J. Rhodes, New techniques in global semigroup theory, inSemigroups and Their Applications, edited by S.M. Goberstein and P.M. Higgins, Reidel, Dordrecht, 1987, pp. 169–181.

    Google Scholar 

  19. J. Rhodes and B. Tilson, Improved lower bounds for the complexity of finite semigroups,Journal of Pure and Applied Algebra 2 (1972), 13–71.

    Article  MathSciNet  Google Scholar 

  20. B. Tilson,Chapter XI and XII of reference [4]

    Google Scholar 

  21. B. Tilson, Type II redux, inSemigroups and Their Applications, edited by S.M. Goberstein and P.M. Higgins, Reidel, Dordrecht, 1987, pp., 201–205.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

Communicated by Boris M. Schein

This work was supported by the PRC Mathématiques et Informatique.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Pin, J.E. On a conjecture of Rhodes. Semigroup Forum 39, 1–15 (1989). https://doi.org/10.1007/BF02573280

Download citation

  • Received:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02573280

Keywords

Navigation