Skip to main content
SpringerLink
Log in

Description des Monoïdes de Type Fini

  • Conference paper
  • First Online:
Book cover Semigroups

Part of the book series: Lecture Notes in Mathematics ((LNM,volume 855))

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 34.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 46.00
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Bibliographie

  1. Benois, M.: Parties rationnelles du groupe libre, C.R. Acad. Sci. Paris, A 269, 1188–1190.

    Google Scholar 

  2. Berstel, J.: Transduction and context free languages, Teubner, 1979.

    Google Scholar 

  3. Berstel, J.: Congruences plus que parfaites et langages algébriques, Séminaire d'Informatique théorique, Université Paris VI, Paris, 1977, 123–147.

    Google Scholar 

  4. Cartier, P. et D. Foata: Problèmes combinatoires de commutation et réarrangement, Lecture Notes in Math. 85, Springer, 1969.

    Google Scholar 

  5. Eilenberg, S.: Automata, Languages, and Machines, vol. A, Academic Press, 1974.

    Google Scholar 

  6. Fliess, M.: Deux applications de la représentation matricielle d'une série rationnelle non commutative, J. of Algebra, 1971, 344–353.

    Google Scholar 

  7. Ginsburg, S.: The mathematical theory of context free languages, Mc Graw Hill, 1966.

    Google Scholar 

  8. Give'on, Y.: On some properties of free monoids with applications to automata theory, J. of Comput and System Sci. 1, 1967, 137–154.

    Article  MathSciNet  MATH  Google Scholar 

  9. Lallement, G.: Semigroups and combinatorial applications, Wiley, 1978.

    Google Scholar 

  10. Lascoux A. et M.P. Schützenberger: Monoide plaxique, in Non commutative structures in Algebra and geometric combinatorics (A. de Luca, ed), à paraître.

    Google Scholar 

  11. Levy, F.: Über die Untergruppen der freien Gruppen. II, Math. Z. 37, 1933, 90–97.

    Article  MathSciNet  MATH  Google Scholar 

  12. Lyndon, R. et P. Shupp: Combinatorial group theory, Springer, 1978

    Google Scholar 

  13. Magnus, W., A. Karrass, et D. Solitar: Combinatorial group theory, J. Wiley, 1966.

    Google Scholar 

  14. Nivat, M.: Transductions des langages de Chomsky, Ann. Inst. Fourier 18, 1968, 339–455.

    Article  MathSciNet  MATH  Google Scholar 

  15. Nivat, M. et M. Benois: Congruences parfaites quasi-parfaites, in séminaire Dubreil, année 71/72, (miméo).

    Google Scholar 

  16. Nivat, M. et J.F. Perrot: Une généralisation du monoide bicyclique, C.R. Acad. Sc. Paris, A 271, 1970, 824–827.

    MathSciNet  MATH  Google Scholar 

  17. Sakarovitch, J.: Monoides syntaxiques et langages algébriques, Th. 3ème cycle Math., Univ. Paris VII, Paris, 1976.

    Google Scholar 

  18. Sakarovitch, J.: Un théorème de transversale rationnelle pour les automates à pile déterministes, in Proc. of the 4 th G.I. conf. on Theoretical Computer Sci., (K. Weihrauch, ed.), Lecture Notes in Computer Sci. 67, Springer, 1979, 276–285.

    Google Scholar 

  19. Sakarovitch, J.: Syntaxe des langages de Chomsky, Th. Sc. Math., Univ. Paris VII, Paris, 1979.

    Google Scholar 

  20. Schützenberger, M.P.: Certain elementary families of automata, in Proc. of the Symposium on Mathematical Theory of Automata, Polytechnic Institute of Brooklyn, 1962, 139–153.

    Google Scholar 

  21. Schützenberger, M.P.: la correspondance de Robinson, in Combinatoire et représentation du groupe symétrique, Lect. Notes in Math. 579, springer, 1976, 61–115.

    Google Scholar 

  22. Schützenberger, M.P.: Présentation du monoide plaxique, in Actes du Séminaire d'Informatique Théorique 78–79, Université Paris VI, à paraître.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Laboratorie d'Informatique Théorique et Programmation, C.N.R.S., Paris

    Jacques Sakarovitch

Authors
  1. Jacques Sakarovitch
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Helmut Jürgensen Mario Petrich Hanns Joachim Weinert

Rights and permissions

Reprints and permissions

Copyright information

© 1981 Springer-Verlag

About this paper

Cite this paper

Sakarovitch, J. (1981). Description des Monoïdes de Type Fini. In: Jürgensen, H., Petrich, M., Weinert, H.J. (eds) Semigroups. Lecture Notes in Mathematics, vol 855. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0089812

Download citation

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

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

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

  • Online ISBN: 978-3-540-38656-8

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation