Free Access
RAIRO. Inform. théor.
Volume 15, Number 3, 1981
Page(s) 253 - 279
Published online 01 February 2017
  1. 1. G. AGUZZI, The Theory of Invertible Algorithms, Sem. Ist. Mat. Appl. Fac. Ing., Firenze, 1980. [Zbl: 0476.68027] [MR: 630065] [Google Scholar]
  2. 2. G. AGUZZI, F. CESARINI, R. PINZANI, G. SODA and R. SPRUGNOLI, Towards an Automatic Generation of Interpreters, in Lecture Notes in Computer Science, vol.1, 1973, pp. 94-103, Springer-Verlag, Berlin. [MR: 351143] [Zbl: 0277.68011] [Google Scholar]
  3. 3. G. AGUZZI, F. CESARINI, R. PINZANI, G. SODA and R. SPRUGNOLI, An APL Implementation of an Interpreter Writing System, in APL Congress 73, 1973, pp. 9-15, North-Holland Pub. Co., Amsterdam. [Zbl: 0272.68011] [Google Scholar]
  4. 4. G. AGUZZI, F. CESARINI, R. PINZANI, G. SODA and R. SPRUGNOLI, Tree Structures Handling by APS, in Lecture Notes in Computer Science, Vol. 19, 1974, pp. 120-129, Springer-Verlag, Berlin. [MR: 445896] [Zbl: 0297.68053] [Google Scholar]
  5. 5. G. AGUZZI, R. PINZANI and R. SPRUGNOLI, An Algorithmic Approach to the Semantics of Programming Languages, in Automata, Languages and Programming, M. NIVAT, Ed., 1973, pp. 147-166, North-Holland Pub. Co., Amsterdam. [MR: 388825] [Zbl: 0262.68007] [Google Scholar]
  6. 6. A. CARACCIOLO DI FORINO, Generalized Markov Algorithms and Automata, in Automata Theory, CAIANIELLO, Ed., Academic Press, New York. [Zbl: 0192.06302] [Google Scholar]
  7. 7. A. CARACCIOLO DI FORINO, L. SPANEDDA and N. WOLKENSTEIN, Panon 1B: a Programming Language for Symbol Manipulation, Calcolo, 1966, pp. 245-255. [Zbl: 0221.68031] [Google Scholar]
  8. 8. V. S. CERNIAVSKII, On a Class of Normal Markov Algorithms, A.M.S. Translations, 2, Vol. 48, 1965, pp. 1-35. [Zbl: 0148.24802] [Google Scholar]
  9. 9. D. J. FARBER, R. E. GRISWOLD and I. P. POLONSKY, Snobol, a String Manipulation Language, J. Assoc. Comp. Mach., vol. 11, 1964, pp. 21-30 [Zbl: 0117.12201] [Google Scholar]
  10. 10. B. A. GALLER and A. J. PERLIS, A view of Programming Languages, Addison Wesley, 1970. [MR: 272223] [Zbl: 0234.68002] [Google Scholar]
  11. 11. J. Katznelson, The Markox Algonthm as Language Parser: Linear Bounds, J. Comp. System Sc., Vol. 6, 1972, pp. 465-478. [Zbl: 0247.68030] [Google Scholar]
  12. 12. M. R. LAGANÀ, G. LEONI, R. PINZANI and R. SPRUGNOLI, Improvements in the Execution of Markov Algorithms, Boll. Un. Mat. Italiana, Vol. 11, (4), 1975, pp. 473-489. [MR: 387038] [Zbl: 0323.68030] [Google Scholar]
  13. 13. G. LEONI and R. SPRUGNOLI, The Compilation of Pointer Markov Algorithms, in International Computing Symposium 1975, E. GELENBE and D. POTIER, Eds., 1975, pp. 129-135, North-Holland Pub. Co., Amsterdam. [MR: 483641] [Zbl: 0324.68014] [Google Scholar]
  14. 14. A. A. MARKOV, The Theory of Algortthms, Israel Program for Scientific Translations, Jérusalem, 1962. [MR: 181560] [Google Scholar]
  15. 15. M. PAGET, Propriétés de Complexité pour une Famille d'Algorithmes de Markov, R.A.I.R.O. informatique théorique, Vol. 12, (1), 1978, pp. 15-32. [EuDML: 92061] [MR: 495201] [Zbl: 0368.68056] [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.