Free Access
Issue
RAIRO. Inform. théor.
Volume 14, Number 1, 1980
Page(s) 39 - 56
DOI https://doi.org/10.1051/ita/1980140100391
Published online 01 February 2017
  1. 1. J. A. BRZOZOWSKI and I. SIMON, Characterizations of Locally Testable Events, Discrete Math., Vol. 4, 1973, pp. 243-271. [MR: 319404] [Zbl: 0255.94032] [Google Scholar]
  2. 2. A. H. CLIFFORD and G. B. PRESTON, The Algebraic Theory of Semigroups, Amer. Math. Soc., Providence R.I., 1967. [MR: 218472] [Zbl: 0178.01203] [Google Scholar]
  3. 3. A. DE LUCA, D. PERRIN, A. RESTIVO and S. TERMINI, Synchronization and Simplification, Discrete Mathematics, Vol. 27, 1979, pp. 297-308. [MR: 541474] [Zbl: 0417.68059] [Google Scholar]
  4. 4. A. DE LUCA and A. RESTIVO, On Some Properties of Very Pure Codes, Theoret. Comput. Sc., Vol. 10, 1980, pp.157-170. [MR: 551602] [Zbl: 0421.68078] [Google Scholar]
  5. 5. S. EILENBERG Automata, Languages and Machines, Academic Press, New York-London, Vol. A, 1974, vol. B, 1976. [Zbl: 0359.94067] [Google Scholar]
  6. 6. K. HASHIGUCHI and N. HONDA. Properties of Code Events and Homomorphisms Over Regular Events, J. Comput. System Sc., Vol. 12, 1976, pp. 352-367. [MR: 406734] [Zbl: 0355.94065] [Google Scholar]
  7. 7. R. MCNAUGHTON and S. PAPERT, Counter-Free Automata, M.I.T. Press, Cambridge Mass., 1971. [MR: 371538] [Zbl: 0232.94024] [Google Scholar]
  8. 8. R. MCNAUGHTON, Algebraic Decision Procedures for Local Testability, Math. Systems theory, Vol. 8, 1974, p. 60-76. [MR: 392544] [Zbl: 0287.02022] [Google Scholar]
  9. 9. J. F. PERROT, Informatique et algèbre : la théorie des codes à longueur variable, in Theoret. Comput. Sc., 3rd G.I. Conference, Lectures Notes in Computer Sc., No. 48, 1977, pp. 27-44. [MR: 504335] [Zbl: 0374.94009] [Google Scholar]
  10. 10. A. RESTIVO, On a Question of McNaughton and Papert, Information and Control, Vol. 25, 1974, pp. 93-101. [MR: 418537] [Zbl: 0279.68054] [Google Scholar]
  11. 11. A. RESTIVO, A Combinatorial Property of Codes Having Finite Synchronization Delay, Theoret. Comput. Sc., Vol. 1, 1975, pp. 95-101. [MR: 414224] [Zbl: 0381.94017] [Google Scholar]
  12. 12. M. P. SCHÜTZENBERGER, On an Application of Semigroup Methods to some Problems in Coding, I.R.E. Trans. Information Theory, Vol. I.T. 2, 1956, pp. 47-60. [Google Scholar]
  13. 13. M. P. SCHÜTZENBERGER, Une théorie algébrique du codage, Séminaire Dubreil-Pisot (Algèbre et théorie des nombres), exposé No. 15, 1955/ 1956, Paris. [EuDML: 111094] [Google Scholar]
  14. 14. M. P. SCHÜTZENBERGER, Sur une propriété combinatoire des algèbres de Lie libres pouvant être utilisée dans un problème de mathématique appliquée, Séminaire Dubreil-Pisot (Algèbre et théorie des nombres), exposé No. 1, 1958/ 1959, Paris. [EuDML: 111156] [Google Scholar]
  15. 15. M. P. SCHÜTZENBERGER, Codes à longueur variable, cours à l'Ecole d'été de l'O.T.A.N. sur les méthodes combinatoires en théorie du codage, Royan, France, 1965, unpublished. [Google Scholar]
  16. 16. M. P. SCHÜTZENBERGER, On a Factorization of Free Monoids, Proc. Amer. Math. Soc., Vol. 16, 1965, pp. 21-24. [MR: 170971] [Zbl: 0219.20039] [Google Scholar]
  17. 17. Y. ZALCSTEIN, Locally Testable Semigroups, Semigroup Forum, Vol. 5, 1973, pp. 216-227. [EuDML: 133940] [MR: 320194] [Zbl: 0273.20049] [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.