EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 24 / No 1 (1990) RAIRO-Theor. Inf. Appl., 24 1 (1990) 67-87 References
Free Access
Issue
RAIRO-Theor. Inf. Appl.
Volume 24, Number 1, 1990
Page(s) 67 - 87
DOI https://doi.org/10.1051/ita/1990240100671
Published online 03 February 2017
  1. 1. J. BERSTEL and D. PERRIN, Theory of Codes, Academic Press, 1985. [MR: 797069] [Zbl: 0587.68066] [Google Scholar]
  2. 2. R. V. BOOK, Thue Systems and Church-Rosser Property: Replacement Systems, Specification of Formal Languages and Presentations of Monoids, in Combinatorics on Words, L. CUMMING Ed., Academic Press, 1983, pp. 1-38. [MR: 910127] [Zbl: 0563.68062] [Google Scholar]
  3. 3. DO LONGVAN, Codes avec des mots infinis, R.A.I.R.O. inform. Theor., Vol.16, 1982, pp. 371-386. [EuDML: 92172] [MR: 707638] [Zbl: 0498.68053] [Google Scholar]
  4. 4. DO LONG VAN, Sous-monoïdes et codes avec des mots infinis, Semigroup Forum, Vol. 26, 1983, pp. 75-87. [EuDML: 134593] [MR: 685117] [Zbl: 0504.68054] [Google Scholar]
  5. 5. DO LONG VAN, Ensembles code - Compatibles et une généralisation du théorème de Sardinas/Patterson, Theor. Comp. Science, Vol. 38, 1985, pp. 123-132. [MR: 805138] [Zbl: 0574.20053] [Google Scholar]
  6. 6. DO LONG VAN, Sur les ensembles générateurs minimaux des sous-monoïdes de A∞, C. R. Acad. Sci. Paris, 300, Série I, 1985, pp. 443-446. [MR: 794019] [Zbl: 0578.68063] [Google Scholar]
  7. 7. DO LONG VAN, Caractérisations combinatoires des sous-monoïdes engendrés par un code infinitaire, Hanoi Preprint Séries, No. 6, 1984. [Google Scholar]
  8. 8. DO LONG VAN, Languages écrits par un code infinitaire, Théorème du défaut, Acta Cybernetica, Vol. 7, 1986, pp. 247-257. [MR: 829305] [Zbl: 0611.68046] [Google Scholar]
  9. 9. DO LONG VAN, Codes infinitaires et automates non-ambigus, C. R. Acad. Sci. Paris, T. 302, Séries I, 1986, pp. 693-696. [MR: 847756] [Zbl: 0602.68069] [Google Scholar]
  10. 10. DO LONG VAN, Contribution to Combinatorics on Words, Publication of L.I.T.P., No. 29, 1985. [Google Scholar]
  11. 11. S. EILENBERG, Automata, Languages and Machines, Vol. A, Academic Press, New York/London, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  12. 12. G. LALLEMENT, Semigroups and Combinatorial Application, Wiley, New York, 1979. [MR: 530552] [Zbl: 0421.20025] [Google Scholar]
  13. 13. M. NIVAT, Éléments de la théorie générale des codes, in Automata Theory, E. R. CAIANIELLO (Ed.) Academic Press, New York/London, 1966, pp. 278-294. [MR: 241168] [Zbl: 0208.45101] [Google Scholar]
  14. 14. M. NIVAT and A. ARNOLD, Comportements de processus, in Colloque, Les Mathématiques de l'Informatique, Paris, 1982, pp. 35-68. [Zbl: 0538.68062] [Google Scholar]
  15. 15. M. NIVAT and D. PERRIN, Ensembles reconnaissables de mots biinfinis, Canad. J. Math., Vol. XXXVIII, No. 3, 1986, pp. 513-537. [MR: 845662] [Zbl: 0619.68067] [Google Scholar]
  16. 16. M. P. SCHÜTZENBERGER, Une théorie algébrique du codage, Séminaire Dubrail, expose No. 15, Algebre et théorie des nombres, année 1955-1956. [EuDML: 111094] [MR: 75169] [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.