Skip to main content

A finiteness condition for semigroups

  • Problems Related To The Theory Of Automata
  • Conference paper
  • First Online:
Formal Properties of Finite Automata and Applications (LITP 1988)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 386))

Included in the following conference series:

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

Access this chapter

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. R.D.Blyth, Rewriting products of groups elements, PH.D. Thesis, 1987, University of Illinois at Urbana-Champain.

    Google Scholar 

  2. M. Coudrain and M.P. Schützenberger, Une condition de finitude des monoides finiment engendrés, C.R. Acad. Sc. Paris, Série A,262 (1966)1149–1151.

    Google Scholar 

  3. A. de Luca and A. Restivo, A finiteness condition for finitely generated semigroups, Semigroup Forum, 28 (1984) 123–134.

    Google Scholar 

  4. A.de Luca and S. Varricchio, Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups, 1987, Theoretical Computer Science,to appear.

    Google Scholar 

  5. A. de Luca and S. Varricchio, A combinatorial theorem on p-power-free words and an application to semigroups, 1988, R.A.I.R.O. I.I., to appear.

    Google Scholar 

  6. E. Hotzel, On finiteness conditions in semigroups, Journal of Algebra, 60(1979)352–370.

    Article  Google Scholar 

  7. J. Justin and G. Pirillo, On a natural extension of Jacob's ranks, J. Combin. Theory, Ser. A,43 (1986) 205–218.

    Google Scholar 

  8. G. Lallement, "Semigroups and Combinatorial Applications", J.Wiley & Sons, New York, 1979.

    Google Scholar 

  9. M. Lothaire, "Combinatorics on words", Addison Wesley, Reading Mass. 1983.

    Google Scholar 

  10. F.J.Pastijn and P.G.Trotter, Residual Finiteness in Completely regular semigroups varieties, Tech.Report n.263,Dept.of Math.Statistics and Computer Science,Marquette University, October 1987.

    Google Scholar 

  11. M. Petrich, "Introduction to Semigroups", C. E.Merrill Publ.Company, Columbus, Ohio 1973.

    Google Scholar 

  12. A.Restivo, Permutation properties and the Fibonacci semigroup, Semigroup Forum, to appear.

    Google Scholar 

  13. A. Restivo and C. Reutenauer, On the Burnside problem for semigroups, Journal of Algebra, 89 (1984) 102–104.

    Article  Google Scholar 

  14. A. Restivo and C. Reutenauer,Rational languages and the Burnside problem, Theoretical Computer Science, 40 (1985) 13–30.

    Google Scholar 

  15. I. Simon, Conditions de finitude pour des semi-groupes, C.R. Acad. Sci. Paris Sér.A, 290, (1980) 1081–1082.

    Google Scholar 

  16. S.Varricchio, A finiteness condition for finitely generated semigroups, Semigroup Forum,1988, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

J. E. Pin

Rights and permissions

Reprints and permissions

Copyright information

© 1989 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

de Luca, A., Varricchio, S. (1989). A finiteness condition for semigroups. In: Pin, J.E. (eds) Formal Properties of Finite Automata and Applications. LITP 1988. Lecture Notes in Computer Science, vol 386. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0013117

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-51631-6

  • Online ISBN: 978-3-540-46721-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics