Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 26, Number 4, 1992
Page(s) 363 - 386
DOI https://doi.org/10.1051/ita/1992260403631
Published online 01 February 2017
  1. 1. E. BARBIN-LE REST and M. LE REST, Sur la combinatoire des codes à deux mots, Theor. Comp. Sc., 1985, 41, pp. 61-80. [MR: 841023] [Zbl: 0593.20066]
  2. 2. M. P. BEAL, Codages, automates locaux et entropie, Thèse, Publications du L.I.T.P., 38, Université de Paris-VII, 1988.
  3. 3. D. BEAUQUIER, Automates sur les mots biinfinis, Thèse d'état, Université Paris-VII, 1986.
  4. 4. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, Orlando, 1985. [MR: 797069] [Zbl: 0587.68066]
  5. 5. F. BLANCHARD, Codes engendrant certains systèmes sofiques, Theoret. Comput. Sci., 1989, 68, pp. 253-265. [MR: 1031960] [Zbl: 0683.28009]
  6. 6. J. DEVOLDER, Precircular Codes and Periodic Biinfinite Words, Publications du L.I.F.L., I.T. 175, 1989, Inform. and Comput. (to appear). [MR: 1251618] [Zbl: 0790.94007]
  7. 7. J. DEVOLDER, M. LATTEUX, I. LITOVSKY and L. STAIGER, Codes and Infinite Words, Publications du L.I.F.L., I.T. 220, 1991.
  8. 8. J. DEVOLDER and E. TIMMERMAN, Codes for Biinfinite Words, Publications du L.I.F.L., I.T. 194, 1990. [Zbl: 0754.68066]
  9. 9. DO LONG VAN, Codes avec des mots infinis, R.A.I.R.O. Inform. Theor. Appl., 1982, 16, pp. 371-386. [EuDML: 92172] [Zbl: 0498.68053]
  10. 10. DO LONG VAN, D. G. THOMAS, K. G. SUBRAMANIAN and R. SIROMONEY, Bi-Infinitary Codes, RAIRO Inform. Theor. Appl. , 1990, 24, 1, pp. 67-87. [EuDML: 92350] [Zbl: 0701.68061]
  11. 11. S. EILENBERG, Automata, Languages, and Machines, Academic Press, New York, 1974.
  12. 12. J. KARHUMAKI, On Three-Element Codes, Theoret. Comput.Sci., 1985, 40, pp. 3-11. [Zbl: 0574.68062]
  13. 13. J. L. LASSEZ, Circular codes and synchronisation, Internat. J. Comput. Syst. Sci., 1976, 5, pp. 201-208. [Zbl: 0401.68050]
  14. 14. M. LECONTE, K-th Power-Free Codes, Automata on infinite words, Lecture notes in Comput. Sci., 1984, 192, pp. 172-187. [Zbl: 0571.68054]
  15. 15. A. LENTIN and M. P. SCHUTZENBERGER, A Combinatorial Problem in the Theory of Free Monoids, Proc. Univ. of North Carolina, 1967, pp. 128-144. [Zbl: 0221.20076]
  16. 16. I. LITOVSKY, Générateurs des langages rationnels de mots infinis, Thèse, Université de Lille-I, 1988.
  17. 17. A. DE LUCA and A. RESTIVO, On Some Properties of Very Pure Codes, Theoret. Comput. Sci., 1980, pp. 157-170. [MR: 551602] [Zbl: 0421.68078]
  18. 18. M. NIVAT and D. PERRIN, Ensembles reconnaissables de mots biinfinis, Proc. 14e Symp. on Theory of Computing, 1982, pp.47-59. [Zbl: 0589.68056]
  19. 19. A. RESTIVO, Codes and automata, Lecture notes in Comput. Sci., 1989, 386, pp. 186-198. [MR: 1051960]
  20. 20. L. STAIGER, On Infinitary Finite Length Codes, R.A.I.R.O., Inform. Théor. Appl., 1986, 20, 4, pp. 483-494. [EuDML: 92273] [MR: 880849] [Zbl: 0628.68056]

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.