Free Access
Issue
R.I.R.O.
Volume 4, Number R1, 1970
Page(s) 109 - 125
DOI https://doi.org/10.1051/m2an/197004R101091
Published online 01 February 2017
  1. A. V. AHO et J. D. ULLMAN, Properties of syntax directed translations, J. Comput. System Sci., 3, 1969, p. 319-334. [MR: 252130] [Zbl: 0174.02802] [Google Scholar]
  2. N. CHOMSKY et M. P. SCHÜTZENBERGER, The algebraic theory of context-free languages, in « Computer Programming and Formal Systems » (édit. P. Braffort et D. Hirschberg), p. 118-161, North Holland, Amsterdam, 1963. [MR: 152391] [Zbl: 0148.00804] [Google Scholar]
  3. S. EILENBERG, Algèbre catégorique et théorie des automates, cours donné à Paris à l'Institut H. Poincaré en 1967, rédigé par R. Roussarie, miméographié. [Google Scholar]
  4. S. EILENBERG et J. B. WRIGHT, Automata in general algebras, Control, 11, 1967, p. 452-470. [MR: 223285] [Zbl: 0175.27902] [Google Scholar]
  5. C. C. ELGOT et J. E. MEZEI, On relations defined by generalized finite automata,IBM J. Res. Develop., 9, 1965, p. 47-68. [MR: 216903] [Zbl: 0135.00704] [Google Scholar]
  6. M. FLIESS, Transductions et séries formelles, thèse de 3e cycle, Faculté des Sciences de Paris, 1969. [Google Scholar]
  7. S. GINSBURG, The mathematical theory of context-free languages, McGraw-Hill,New York, 1966. [MR: 211815] [Zbl: 0184.28401] [Google Scholar]
  8. S. GINSBURG et G. F. ROSE, Preservation of languages by transducers, Inform. Control, 9, 1966, p. 153-170. [MR: 235933] [Zbl: 0186.01301] [Google Scholar]
  9. S. GINSBURG et G. F. ROSE, A note on preservation of languages by transducers, Inform. Control, 12, 1968, p. 549-552. [MR: 235934] [Zbl: 0165.02301] [Google Scholar]
  10. W. M. GLUSCHKOW, Theorie der abstrakten Automaten, VEB Deutscher Verlag der Wissenschaften, Berlin, 1963 (Übersetzung aus dem Russischen). [MR: 167418] [Zbl: 0128.01307] [Google Scholar]
  11. M. GROSS et A. LENTIN, Notions sur les grammaires formelles, Gauthier-Villars, Paris, 1967. [MR: 226970] [Zbl: 0165.31901] [Google Scholar]
  12. M.A HARISSON et O. H. IBARRA, Multi-tape and multi-head pushdown automata, Inform. Control, 13, 1968, p. 433-470. [MR: 238622] [Zbl: 0174.02701] [Google Scholar]
  13. B. MITCHELL, Theory of catégories, Academic Press, New York, 1965. [MR: 202787] [Zbl: 0136.00604] [Google Scholar]
  14. M. NIVAT, Transductions des langages de Chomsky, Annales de l'Institut Fourier, 18, n° 1, 1968, p. 339-455. [EuDML: 73950] [MR: 238633] [Zbl: 0313.68065] [Google Scholar]
  15. A. G. OETTINGER, Automatic syntactic analysis and the pushdown store, in « Structure of language and its mathematical aspects », Proc. 12th Symposium in Appl. Math., p. 104-129, Amer. Math. Soc, Providence (R.I.), 1961. [Google Scholar]
  16. R. J. PARIKH, On context-free languages, J. Assoc. Comput. Mach., 13, 1966, p. 570-581. [MR: 209093] [Zbl: 0154.25801] [Google Scholar]
  17. J. F. PERROT, Sur la fermeture commutative des C-langages, C. R. Acad. Sci. Paris, 265, 1967, série A, p. 597-600. [MR: 221877] [Zbl: 0168.25802] [Google Scholar]
  18. M. P. SCHÜTZENBERGER, A remark on finite transducers, Inform. Control, 4, 1961, p. 185-196. [MR: 143682] [Zbl: 0119.13901] [Google Scholar]
  19. M. P. SCHÜTZENBERGER, On a theorem of R. Jungen, Proc. Amer. Math. Soc., 13, 1962, p. 885-890. [MR: 142781] [Zbl: 0107.03102] [Google Scholar]
  20. E. SHAMIR, A representation theorem for algebraic and context-free power series in non commuting variables, Inform. Control, 11, 1967, p. 239-254. [MR: 228297] [Zbl: 0165.02302] [Google Scholar]
  21. Dans l'article suivant, le lecteur pourra trouver une démonstration du théorème 2 du § I et des compléments au § IV : M. FLIESS, Séries reconnaissables, rationnelles et algébriques, Bulletin des Sciences mathématiques, 95, 1971 (à paraître). [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.

Recommended for you