Free Access
RAIRO-Theor. Inf. Appl.
Volume 22, Number 3, 1988
Page(s) 311 - 318
Published online 01 February 2017
  1. 1. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, 1985. [MR: 797069] [Zbl: 0587.68066]
  2. 2. Y. CESARI, Sur un algorithme donnant les codes bipréfixes finis, Math. Syst. Theory, Vol. 6, 1972, pp. 221-225. [MR: 319651] [Zbl: 0241.94015]
  3. 3. Y. CESARI, Propriétés Combinatoires des codes bipréfixes complets finis, in Actes de la Septième École de Printemps d'Informatique Théorique, Jougne, 1979, D. Perrin ed., LITP.
  4. 4. S. EILENBERG, Automata, Languages and Machines, Academic Press, Vol. A, 1974, p. 32. [Zbl: 0317.94045]
  5. 5. E. N. GILBERT and E. F. MOORE, Variable-length Binary Encodings, Bell. Syst. Techn., J38, 1959, pp. 933-967. [MR: 108413]
  6. 6. M. LÉONARD, Thèse de Doctorat ès Sciences, Université de Rouen, 1985.

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.