Free Access
RAIRO-Theor. Inf. Appl.
Volume 20, Number 1, 1986
Page(s) 89 - 96
Published online 01 February 2017
  1. [BPS] J. BERSTEL, D. PERRIN and M. P. SCHUTZENBERGER, The Theory of Codes(to appear). [Google Scholar]
  2. [E] S. EILENBERG, Automata, Languages and Machines, Vol. A, 1974, Academic Press, New York and London. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  3. [F] W. FELLER, An Introduction to Probability Theory and its Applications, Vol. 1, 1950, J. Wiley. [MR: 38583] [Zbl: 0039.13201] [Google Scholar]
  4. [P1] D. Ed.PERRIN, Theorie des codes, L.I.T.P. Publication, Paris, 1979. [Zbl: 0628.94001] [Google Scholar]
  5. [P2] D. PERRIN, Completing Biprefix Codes, Lecture Notes in Computer Science, Vol. 140, 1982, pp. 397-406. [MR: 675474] [Zbl: 0485.68075] [Google Scholar]
  6. [P3] D. PERRIN, Séries formelles et combinatoire du monoide libre, in J. Berstel Ed., Series Formelles, L.I.T.P., Paris, 1977. [Google Scholar]
  7. [R] A. RESTIVO, On Codes Having no Finite Completions, in Automata, Languages and Programming, S. MICHAELSON Ed., Edinburgh University Press, 1976, pp. 38-44. [MR: 498922] [Google Scholar]
  8. [S] A. SALOMAA, Formal Languages, Academic Press, London, New York, 1973. [MR: 438755] [Zbl: 0262.68025] [Google Scholar]
  9. [Sch] M. P. SCHUTZENBERGER, Une théorie algébrique du codage, Seminaire Dubreuil-Pisot, année 55-56, exp. No. 15, Inst. Henri-Poincaré, Paris, 1956. [MR: 75169] [Google Scholar]
  10. [SM] M. P. SCHUTZENBERGER and R. S. MARCUS, Full Decodable Code Word Sets, I.R.E. Trans on Inf. Theroy, Vol. 5, 1959, pp. 13-15. [MR: 130045] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.