Skip to main content
SpringerLink
Log in
Book cover

International Colloquium on Automata, Languages, and Programming

ICALP 1990: Automata, Languages and Programming pp 501–511Cite as

Decomposition of partial commutations

  • Conference paper
  • First Online:

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

Abstract

We define atomic partial commutations that are associated to independence relations of the form A1×A2 ∪ A2×A1 where A1, A2 are two disjoint subsets of the alphabet. Then we prove that each partial commutation can be obtained as the composition of atomic partial commutations.

This work was supported by the P.R.C. Mathématiques et Informatique and by the EBRA project Algebraic and Syntatic Methods in Computer Science.

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. IJ.J. Aalbersberg and G. Rozenberg, Theory of traces, Theoretical Computer Science 60 (1988) 1–82.

    Google Scholar 

  2. J.Berstel, Transductions and Context-Free Languages (Teubner, 1979).

    Google Scholar 

  3. J. Berstel and J. Sakarovich, Recent results in the theory of rational sets, Lect.Notes in Comp.Sci. 233(1986) 15–28.

    Google Scholar 

  4. P.Cartier and D.Foata, Problèmes combinatoires de commutations et réarrangements, Lect. Notes in Math. 85(1969).

    Google Scholar 

  5. M.Clerbout, Commutations partielles et familles de languages, Thesis, University of Lille, 1984.

    Google Scholar 

  6. M.Clerbout, Compositions de fonctions de commutation partielle, to appear in RAIRO Inform.Theor., 1986.

    Google Scholar 

  7. M.Clerbout and D.Gonzalez, Decomposition of semi-commutations, to appear.

    Google Scholar 

  8. M. Clerbout and M. Latteux, Partial commutations and faithful rational transductions, Theoretical Computer Science 34(1984) 241–254.

    Google Scholar 

  9. M.Clerbout and M.Latteux, On a generalization of partial commutations, in: M.Arato, I.Katai, L.Varga, eds, Proc.Fourth Hung. Computer Sci.Conf. (1985) 15–24.

    Google Scholar 

  10. M. Clerbout and M. Latteux, Semi-commutations, Information and Computation 73(1987) 59–74.

    Google Scholar 

  11. R. Cori, Partially abelian monoids, Invited lecture, STACS, Orsay, 1986.

    Google Scholar 

  12. R. Cori and D. Perrin, Automates et commutations partielles, RAIRO Inform. Theor. 19(1985) 21–32.

    Google Scholar 

  13. M. Latteux, Rational cones and commutations, to appear in Machines, Languages and Complexity, J. Dassow and J. Kelemen eds., Lect. Notes in Comp. Sci.

    Google Scholar 

  14. A.Mazurkiewicz, Concurrent program schemes and their interpretations, DAIMI PB 78, University of Aarhus, 1977.

    Google Scholar 

  15. A. Mazurkiewicz, Traces, histories and graphs: instances of process monoids, Lect.Notes in Comp.Sci. 176(1984) 115–133.

    Google Scholar 

  16. Y. Metivier, On recognizable subsets of free partially commutative monoids, Lect.Notes in Comp.Sci. 226(1986) 254–264.

    Google Scholar 

  17. E. Ochmanski, Regular behaviour of concurrent systems, Bulletin of EATCS 27(1985) 56–67.

    Google Scholar 

  18. D.Perrin, Words over a partially commutative alphabet, NATO ASI Series F12, Springer (1985) 329–340.

    Google Scholar 

  19. Y.Roos, Contribution à l'étude des fonctions de commutation partielle, Thesis, University of Lille, 1989.

    Google Scholar 

  20. W. Zielonka, Notes on asynchronous automata, RAIRO Inform.Theor. 21(1987) 99–135.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. University of Lille Flandres Artois, LIFL,CNRS UA 369, F-59655, Villeneuve d'Ascq Cédex

    Mireille Clerbout, Michel Latteux & Yves Roos

Authors
  1. Mireille Clerbout
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michel Latteux
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yves Roos
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Michael S. Paterson

Rights and permissions

Reprints and permissions

Copyright information

© 1990 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Clerbout, M., Latteux, M., Roos, Y. (1990). Decomposition of partial commutations. In: Paterson, M.S. (eds) Automata, Languages and Programming. ICALP 1990. Lecture Notes in Computer Science, vol 443. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0032054

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52826-5

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

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation