Skip to main content
SpringerLink
Log in

Codes et sous-monoides possedant des mots neutres

  • Vorträge In Der Reihenfolge Des Programms
  • Conference paper
  • First Online:
Theoretical Computer Science

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

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.

Références

  1. BERSTEL, J.— Sur la densité asymptotique des langages formels, in Automata Languages and Programming (M. Nivat ed.) North Holland (1972) 345–58.

    Google Scholar 

  2. BOE, J.M.— Représentations des monoides: applications à la théorie des codes, Thèse de 3ème cycle, Univ. des Sciences et Techniques du Languedoc (1976).

    Google Scholar 

  3. BOE, J.M., BOYAT, J. CESARI, Y., LACHENY, A. et M. VINCENT, Automates et monoides syntaxiques des sous-monoides libres, à paraître dans Information and Control.

    Google Scholar 

  4. EILENBERG, S.— Automata, Languages and Machines, Vol. A, Academic Press (1974).

    Google Scholar 

  5. LALLEMENT, G.— On regular semigroups as syntactic monoids of prefix codes, à paraître dans Theoretical Computer Science.

    Google Scholar 

  6. NIVAT, M.— Eléments de la théorie générale des codes, in Automata Theory (E.R. Caianiello ed.) Academic Press (1966).

    Google Scholar 

  7. Mc NAUGHTON, R. and PAPERT, S.— Counter-Free Automata, MIT Press (1971).

    Google Scholar 

  8. PERROT, J-F.— Contribution à l'Etude des Monoides Syntaxiques et de Certains Groupes Associés aux Automates Finis, Thèse, Paris (1972).

    Google Scholar 

  9. RESTIVO, A.— On codes having no finite completions, in Automata, Languages and Programming (S. Michaelson ed.) Edinburgh University Press (1976) 38–44.

    Google Scholar 

Download references

Authors
  1. D. Perrin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. -P. Schützenberger
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 1977 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Perrin, D., Schützenberger, M.P. (1977). Codes et sous-monoides possedant des mots neutres. In: Theoretical Computer Science. Lecture Notes in Computer Science, vol 48. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08138-0_23

Download citation

  • DOI: https://doi.org/10.1007/3-540-08138-0_23

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-08138-8

  • Online ISBN: 978-3-540-37389-6

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation