Skip to main content
SpringerLink
Log in

Sous-monoides et codes avec des mots infinis

  • Research Article
  • Published:
Semigroup Forum Aims and scope Submit manuscript

    We’re sorry, something doesn't seem to be working properly.

    Please try refreshing the page. If that doesn't work, please contact support so we can address the problem.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Bibliographie

  1. Berstel J., D. Perrin, M.P. Schützenberger,Théorie des codes, Publication LITP, no ɛ1-63.

  2. Eilenberg, S.,Automata, Languages and Machines, vol. A, Academic Press, New York, 1974.

    Google Scholar 

  3. Perrin D.,Théorie des codes, Actes de la 7ème Ecole de Printemps d'Informatique Théorique, Jougne 1979.

  4. Do Long Van,Codes avec des mots infinis (à paraître dans la RAIRO).

Download references

Author information

Authors and Affiliations

  1. Institut de Mathématiques, 208 D Doi Can, Hanoi, Vietnam

    Do van Long

Authors
  1. Do van Long
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

communiqué par G. Lallement

Rights and permissions

Reprints and permissions

About this article

Cite this article

van Long, D. Sous-monoides et codes avec des mots infinis. Semigroup Forum 26, 75–87 (1983). https://doi.org/10.1007/BF02572821

Download citation

  • Received:

  • Revised:

  • Issue Date:

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

Search

Navigation