Free Access
R.A.I.R.O. Informatique théorique
Volume 9, Number R2, 1975
Page(s) 25 - 37
Published online 01 February 2017
  1. J. BERSTEL et L. BOASSON, Une suite décroissante de cônes rationnels, in : Loeckx (Ed.), Automata, Languages and Programming, 2nd Colloquium, Saarbrücken, Springer-Verlag 1974, 383-397. [Zbl: 0288.68037] [Google Scholar]
  2. L. BOASSON et M. NIVAT, Sur diverses familles de langages fermées par transduction rationnelle, Acta Informatica 2 (1973). 180-188. [Zbl: 0242.68037] [Google Scholar]
  3. R. V. BOOK, Tally languages and complexity classes, Information and Control, 26 (1974), 186-193. [Zbl: 0287.68029] [Google Scholar]
  4. S. EILENBERG, Automata, Languages and Machines, vol. A, Academic Press, 1974. [Zbl: 0317.94045] [Google Scholar]
  5. S. GINSBURG and J. GOLDSTINE, Intersection closed full AFL and the recursively enumerable languages, Information and Control, 22 (1973), 201-231. [Zbl: 0267.68035] [Google Scholar]
  6. J. GOLDSTINE, Substitution and bounded languages, Journal of Computer and System Science, 6, 1972, 9-29. [Zbl: 0232.68030] [Google Scholar]
  7. S. A. GREIBACH, An infinite hierarchy of context-free languages, J. Assoc. Comp. Mach., 16 (1969), 91-106. [Zbl: 0182.02002] [Google Scholar]
  8. M. NIVAT, Transductions des langages de Chomsky, Annales de l'Institut Fourier, 18 (1968), 339-456. [EuDML: 73950] [Zbl: 0313.68065] [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.