Skip to main content
SpringerLink
Log in

Semi-commutations and algebraic languages

  • Conference paper
  • First Online:
STACS 90 (STACS 1990)

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

Included in the following conference series:

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

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. Cartier and D. Foata, “Problèmes combinatoires de commutations et réarrangements”, Lecture Notes in Mathematics 85, Springer-Verlag, Berlin.

    Google Scholar 

  2. M.Clerbout, “Commutations partielles et familles de langages”, thesis 1984, University of Lille I.

    Google Scholar 

  3. M.Clerbout and M.Latteux, “On a generalization of partial commutation”, in M.Arato, I.Katai, L.Varga, eds, Proc.Fourth Hungarian Computer Science Conference, 1985, pp 15–24.

    Google Scholar 

  4. M. Clerbout and M. Latteux, “Semi-commutations”, Information and Computation, 73 (1987), pp 59–74.

    Article  Google Scholar 

  5. R. De Simone, “Langages infinitaires et produit de mixage”, Theoretical Computer Science 31 (1984), pp 83–100.

    Article  Google Scholar 

  6. G.Lampérth, “Reducedness of formal languages”, IMYCS conference, Smolenice 1986, pp 215–219.

    Google Scholar 

  7. M. Latteux, “Cônes rationnels commutatifs”, JCSS 18 (1979), pp 307–333.

    Google Scholar 

  8. A.Mazurkiewicz, “Concurrent Program Schemes and their interpretations”, Daimi, pb 78, Aarhus University, 1977.

    Google Scholar 

  9. Y.Métivier, “Semi-commutations dans le monoïde libre”, Tech. Rep. University of Bordeauxl.

    Google Scholar 

  10. Y.Métivier, “Contribution à l'étude des monoïdes de commutations”, thesis 1987, University of Bordeaux I.

    Google Scholar 

  11. Y.Métivier and E.Ochmanski, “On lexicographic semi-commutations”, Tech. Rep., University of Bordeaux I, 1986.

    Google Scholar 

  12. Y.Métivier and Sijelmassi, “Communications de processus et semi-commutations; algébricité de la clôture d'une classe de rationnels”, Tech.Rep., University of Bordeaux I, 1987.

    Google Scholar 

  13. H.Mountassir and R.Sijelmassi, “Formulation syntaxique de la communication de processus asynchrones à travers des canaux fifo”, Tech. Rep., University of Bordeaux I, 1987.

    Google Scholar 

  14. M.Szijarto, “The closure of languages on a binary relation”, IMYCS Conference, Smolenice 1982.

    Google Scholar 

  15. M.Szijarto and Dang Van Hung, “Synchronized parallel composition of languages”, Proceedings of the conference ‘On Automata, Languages and Programming Systems', Salgotarjan 1986, pp 281–288.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. L.I.F.L., CNRS UA 369, Université des Sciences et Techniques de Lille, Flandres et Artois, 59655, Villeneuve d'Ascq, France

    Mireille Clerbout & Yves Roos

Authors
  1. Mireille Clerbout
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yves Roos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Christian Choffrut Thomas Lengauer

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clerbout, M., Roos, Y. (1990). Semi-commutations and algebraic languages. In: Choffrut, C., Lengauer, T. (eds) STACS 90. STACS 1990. Lecture Notes in Computer Science, vol 415. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-52282-4_34

Download citation

  • DOI: https://doi.org/10.1007/3-540-52282-4_34

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52282-9

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation