Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1984: Automata, Languages and Programming pp 337–346Cite as

Languages and inverse semigroups

  • Conference paper
  • First Online:

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

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

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. J. Berstel, Transductions and Context-free languages. Teubner (1979).

    Google Scholar 

  2. A.H. Clifford and G.B. Preston, The algebraic theory of semigroups, Math. Surveys 7, Amer. Math. Soc., Providence, Vol. 1 (1961), Vol 2 (1967).

    Google Scholar 

  3. S. Eilenberg, Automata, Languages and Machines, Academic Press, Vol. B (1976)

    Google Scholar 

  4. T.E. Hall, Biprefix codes, inverse semigroups and syntactic monoids of injective automata. To appear.

    Google Scholar 

  5. M. Keenan and G. Lallement, On certain codes admitting inverse semigroups as syntactic monoids, Semigroup Forum 8, (1974), 312–331.

    Google Scholar 

  6. S.W. Margolis, On the syntactic transformation semigroup of a language generated by a finite biprefix code, Theoretical Computer Science 21, (1982), 225–230.

    Google Scholar 

  7. W.D. Munn, Free inverse semigroups, Proc. London Math Soc. 3, 29 (1974), 385–404.

    Google Scholar 

  8. J.P. Pécuchet, Automates boustrophédons, semigroupe de Birget et monoide inversif libre, to appear.

    Google Scholar 

  9. G. Lallement, Semigroups and Combinatorial applications, Wiley, New York, (1979)

    Google Scholar 

  10. J.E. Pin, Arbres et hiérarchies de concaténation, 10th ICALP, LNCS 154, (1983), 617–628.

    Google Scholar 

  11. J.E. Pin, On varieties of rational languages and variable length codes, J. Pure and Applied Algebra 23, (1982), 169–196.

    Google Scholar 

  12. J.E. Pin, Variétés de langages formels. Masson (1984).

    Google Scholar 

  13. J.F. Perrot, Codes de Brandt, in Théorie des codes, actes de la 7ème Ecole de Printemps d'Informatique Théorique, édités par D. Perrin, (1979), 177–183.

    Google Scholar 

  14. Ch. Reutenauer, Une topologie du monoide libre, Semigroup Forum 18, (1979), 33–49.

    Google Scholar 

  15. H.E. Scheiblich, Free inverse semigroups, Proc. Amer. Math. Soc. 38, (1973), 1–7.

    Google Scholar 

  16. J.C. Birget et J. Rhodes, Group theory via global semigroup theory, to appear.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science, Votey Building, Burlington, Vermont, USA

    S. W. Margolis

  2. Université Paris VI et CNRS, Tour 55–65 4 place Jussieu, 75230, Paris Cedex 05

    J. E. Pin

Authors
  1. S. W. Margolis
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. J. E. Pin
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Jan Paredaens

Rights and permissions

Reprints and permissions

Copyright information

© 1984 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Margolis, S.W., Pin, J.E. (1984). Languages and inverse semigroups. In: Paredaens, J. (eds) Automata, Languages and Programming. ICALP 1984. Lecture Notes in Computer Science, vol 172. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-13345-3_30

Download citation

  • DOI: https://doi.org/10.1007/3-540-13345-3_30

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-13345-2

  • Online ISBN: 978-3-540-38886-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation