Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 10, Number R1, 1976
Page(s) 5 - 28
DOI https://doi.org/10.1051/ita/197610R100051
Published online 01 February 2017
  1. BAKER B. S., Tree transductions and families of tree languages. 5th ACM Symposium on theory of Computing (1973). [MR: 464711] [Zbl: 0319.68040]
  2. BRAINERD W. S., Tree-generating regular System. Information and Control, 14 (1969), 218-231. [MR: 239875] [Zbl: 0169.31601]
  3. DOWNEY P., Formal languages and recursion schemas, ph. D. dissertation Harvard University (1974).
  4. DOWNEY P., Tree transducers and ETOL Tree Systems. Conference on formal languages, automata and development. Noordwijkerhout, The Netherlands (avril 1975).
  5. HERMAN G. T. et ROZENBERG G., Developmental Systems and Languages. North-Holland P. C. (1975). [MR: 495247] [Zbl: 0306.68045]
  6. LATTEUX M., Langages simultanés. Publication du laboratoire de calcul de Lille, n° 46 (1974).
  7. LUCKHAM D. C., PARK D. M. et PATERSON M. S. On formalized computer programs. J. Comput. System Sci., 4 (1970), 220-249. [MR: 275717] [Zbl: 0209.18704]
  8. MEZEI J. et WRIGHT J. B., Algebraic automata and context-free sets. Math Systems Theory, 4 (1970), 257-287.
  9. ROUNDS W. C., Mappings and grammars on trees. Math Systems Theory, 4 (1970), 257-287. [MR: 269440] [Zbl: 0203.30103]
  10. ROZENBERG G., Extensions of tabled OL-Systems and Languages. Internat. J. Comput. Information Sci, 2 (1973), 311-336. [MR: 413614] [Zbl: 0293.68065]
  11. THATCHER J. W., Generalized2 sequential machine maps. J. Comput. System Sci., 4 (1970), 339-367. [MR: 302335] [Zbl: 0198.03303]

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.