Advertisement

Une famille remarquable de codes indecomposables

  • J. M. Boe
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 62)

Keywords

34060 MONTPELLIER CEDEX Nous Montrons Code Synchronisant Nous Appellerons Nous Montrerons 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    CESARI Y., Sur l'application du théorème de Suschkevitch à l'étude des codes rationnels complets, in Automata, Language and Programming (J. Loeckx ed.). Springer-Verlag (1974) 342–350.Google Scholar
  2. [2]
    EILENBERG S., Automata, Languages and Machines, Vol. A, Academic Press (1974).Google Scholar
  3. [3]
    NIVAT M., Eléments de la théorie générale des codes, in Automata Theory (E.R. Caianiello ed.) Academic Press (1966) 278–294.Google Scholar
  4. [4]
    PERRIN D., Codes asynchrones, Bull. Soc. Math. de France (1978) à paraître.Google Scholar
  5. [5]
    SCHUTZENBERGER M.P., Sur certains sous-monoïdes libres. Bull. Soc. Math. de France, 93 (1965) 209–223.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1978

Authors and Affiliations

  • J. M. Boe
    • 1
  1. 1.Institut de Mathématiques U. S. T. L.Montpellier CedexFrance

Personalised recommendations