Skip to main content

Lazard's factorizations of free partially commutative monoids

  • Formal Languages (Session 6)
  • Conference paper
  • First Online:
Automata, Languages and Programming (ICALP 1991)

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

Included in the following conference series:

  • 146 Accesses

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. BERGE C., Graphes, Gauthiers-Villars, 1983

    Google Scholar 

  2. BERSTEL J., PERRIN D., Theory of codes, Academic Press, 1985

    Google Scholar 

  3. CARTIER P., FOATA D., Problèmes combinatoires de commutations et de réarrangements, Lect. Notes in Math., 85, Springer Verlag, 1969

    Google Scholar 

  4. CHOFFRUT C., Free partially commutative monoids, LITP Report 86-20, Paris, 1986

    Google Scholar 

  5. CORI R., PERRIN D., Automates et commutations partielles, RAIRO Inform. Theor., 19, pp. 21–32, 1985

    Google Scholar 

  6. DROMS C., Isomorphisms of graph groups, Proc. A.M.S., 100, 3, pp. 407–408, 1987

    Google Scholar 

  7. DUBOC C., Commutations dans le monoïde libre: un cadre théorique pour l'étude du parallélisme, Thèse, Université de Rouen, LITP Report 86-25, Paris, 1986

    Google Scholar 

  8. DUCHAMP G., KROB D., Partially commutative formal power series, [in ”Semantics of systems of concurrent processes”, I. Guessarian, ed.], Lect. Notes in Comp. Sc., 469, pp. 256–276, Springer Verlag, 1990

    Google Scholar 

  9. DUCHAMP G., KROB D., Partially commutative structures, LITP Report 90-65, Paris, 1990

    Google Scholar 

  10. DUCHAMP G., THIBON J.Y., Théorèmes de transfert pour les polynômes partiellement commutatifs, Theor. Comput. Sci., 57, pp. 239–249, 1988

    Google Scholar 

  11. LALLEMENT G., Semigroups and combinatorial applications, Wiley, 1979

    Google Scholar 

  12. LALONDE P., Contribution à l'étude des empilements, Publications du LACIM, 4, Montréal, 1991

    Google Scholar 

  13. LOTHAIRE M., Combinatorics on words, Addison Wesley, 1983

    Google Scholar 

  14. KI HANG KIM, MAKAR-LIMANOV L., NEGGERS J., ROUSH F.W., Graph algebras, Journ. of Algebra, 64, pp. 46–51, 1980

    Google Scholar 

  15. METIVIER Y., Une condition suffisante de reconnaissabilité dans un monoïde partiellement commutatif libre, RAIRO Inform. Theor., 20, pp. 121–127, 1986.

    Google Scholar 

  16. GUAIANA G., RESTIVO A., SALEMI S., Star-free trace languages, Preprint

    Google Scholar 

  17. VIENNOT G., Algèbres de Lie libres et monoïdes libres, Lect. Notes in Math., 691, Springer Verlag, 1978

    Google Scholar 

  18. VIENNOT G., Heaps of pieces, I: basic definitions and combinatorial lemmas, [in ”Combinatoire énumérative”, G. Labelle, P. Leroux, eds.], Lect. Notes in Math., 1234, pp. 321–350, Springer Verlag, 1986

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Javier Leach Albert Burkhard Monien Mario Rodríguez Artalejo

Rights and permissions

Reprints and permissions

Copyright information

© 1991 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Duchamp, G., Krob, D. (1991). Lazard's factorizations of free partially commutative monoids. In: Albert, J.L., Monien, B., Artalejo, M.R. (eds) Automata, Languages and Programming. ICALP 1991. Lecture Notes in Computer Science, vol 510. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-54233-7_138

Download citation

  • DOI: https://doi.org/10.1007/3-540-54233-7_138

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-47516-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics