Advertisement

Lazard's factorizations of free partially commutative monoids

  • Gérard Duchamp
  • Daniel Krob
Formal Languages (Session 6)
Part of the Lecture Notes in Computer Science book series (LNCS, volume 510)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    BERGE C., Graphes, Gauthiers-Villars, 1983Google Scholar
  2. [2]
    BERSTEL J., PERRIN D., Theory of codes, Academic Press, 1985Google Scholar
  3. [3]
    CARTIER P., FOATA D., Problèmes combinatoires de commutations et de réarrangements, Lect. Notes in Math., 85, Springer Verlag, 1969Google Scholar
  4. [4]
    CHOFFRUT C., Free partially commutative monoids, LITP Report 86-20, Paris, 1986Google Scholar
  5. [5]
    CORI R., PERRIN D., Automates et commutations partielles, RAIRO Inform. Theor., 19, pp. 21–32, 1985Google Scholar
  6. [6]
    DROMS C., Isomorphisms of graph groups, Proc. A.M.S., 100, 3, pp. 407–408, 1987Google Scholar
  7. [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, 1986Google Scholar
  8. [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, 1990Google Scholar
  9. [9]
    DUCHAMP G., KROB D., Partially commutative structures, LITP Report 90-65, Paris, 1990Google Scholar
  10. [10]
    DUCHAMP G., THIBON J.Y., Théorèmes de transfert pour les polynômes partiellement commutatifs, Theor. Comput. Sci., 57, pp. 239–249, 1988Google Scholar
  11. [11]
    LALLEMENT G., Semigroups and combinatorial applications, Wiley, 1979Google Scholar
  12. [12]
    LALONDE P., Contribution à l'étude des empilements, Publications du LACIM, 4, Montréal, 1991Google Scholar
  13. [13]
    LOTHAIRE M., Combinatorics on words, Addison Wesley, 1983Google Scholar
  14. [14]
    KI HANG KIM, MAKAR-LIMANOV L., NEGGERS J., ROUSH F.W., Graph algebras, Journ. of Algebra, 64, pp. 46–51, 1980Google Scholar
  15. [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. [16]
    GUAIANA G., RESTIVO A., SALEMI S., Star-free trace languages, PreprintGoogle Scholar
  17. [17]
    VIENNOT G., Algèbres de Lie libres et monoïdes libres, Lect. Notes in Math., 691, Springer Verlag, 1978Google Scholar
  18. [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, 1986Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • Gérard Duchamp
    • 2
    • 1
  • Daniel Krob
    • 2
  1. 1.Université Paris 6 and CNRS(LITP)France
  2. 2.Laboratoire d'Informatique de RouenUniversité de Rouen, Faculté des SciencesMont Saint-Aignan CedexFrance

Personalised recommendations