Free Access
Issue
R.A.I.R.O. Informatique théorique
Volume 9, Number R1, 1975
Page(s) 21 - 42
DOI https://doi.org/10.1051/ita/197509R100211
Published online 01 February 2017
  1. ASCHCROFT E. MANNA Z. et PNUELI A., Decidable Properties of Monadic Functional Schemas, in Theory of Machines and Computation, pp. 3-17, Kohavi et Paz ed. Academic Press (1971). [Zbl: 0306.68048]
  2. COUSINEAU F. G. et RIFFLET J.-M., Schémas de Programme : Problèmes d'équivalence et complexité, Thèse de Troisième Cycle, Université Paris 7 (février 1974).
  3. GARLAND S. J. et LUCKHAM D. C., Program Schemes, Recursive Schemes and Formal Languages, J. Comput. System Sci. 7 (1973), n° 2, pp. 119-160. [Zbl: 0277.68010]

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.