Free Access
RAIRO. Inform. théor.
Volume 17, Number 1, 1983
Page(s) 23 - 48
Published online 01 February 2017
  1. 1. A. ARNOLD et M. LATTEUX, A new proof of two theorems about rational transductions, Theoret. Computer Sci., vol. 8, 1979, p. 261-263. [MR: 526208] [Zbl: 0401.68057] [Google Scholar]
  2. 2. J. BERSTEL, Transductions and context-free languages, Teubner, 1979. [MR: 549481] [Zbl: 0424.68040] [Google Scholar]
  3. 3. S. EILENBERG, Automata, Languages, and Machines, vol. A, Academic Press, 1974. [MR: 530382] [Zbl: 0317.94045] [Google Scholar]
  4. 4. K. KOBAYASHI, Classification of formal languages by functionnal binary transductions, Inform. and Control, vol. 15, 1969, p. 95-109. [MR: 249226] [Zbl: 0193.32501] [Google Scholar]
  5. 5. J. SAKAROVITCH, Théorème de transversale rationnelle pour les automates à pile déterministes, in Proc. of the 4th G. I. Conf. on Theoretical Computer Science. (K. Weikrauch, ed.), Lecture Notes in Computer Sci., vol. 67, Springer, 1979, p. 276-285. [MR: 568112] [Zbl: 0405.68067] [Google Scholar]
  6. 6. J. SAKAROVITCH, Syntaxe des langages de Chomsky, Thèse. Sci. Math., Univ., Paris VII, Paris, 1979. [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.