The theory of invertible algorithms
Aguzzi, Gianni
RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981), p. 253-279 / Harvested from Numdam
Access to full text
Full (PDF)
Full (DJVU)
Publié le : 1981-01-01
@article{ITA_1981__15_3_253_0,
     author = {Aguzzi, Gianni},
     title = {The theory of invertible algorithms},
     journal = {RAIRO - Theoretical Informatics and Applications - Informatique Th\'eorique et Applications},
     volume = {15},
     year = {1981},
     pages = {253-279},
     mrnumber = {630065},
     zbl = {0476.68027},
     language = {en},
     url = {http://dml.mathdoc.fr/item/ITA_1981__15_3_253_0}
}

Aguzzi, Gianni. The theory of invertible algorithms. RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications, Tome 15 (1981) pp. 253-279. http://gdmltest.u-ga.fr/item/ITA_1981__15_3_253_0/

1. G. Aguzzi, The Theory of Invertible Algorithms, Sem. Ist. Mat. Appl. Fac. Ing., Firenze, 1980. | MR 630065

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

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

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

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

6. A. Caracciolo Di Forino, Generalized Markov Algorithms and Automata, in Automata Theory, CAIANIELLO, Ed., Academic Press, New York. | Zbl 0192.06302

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

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

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

10. B. A. Galler and A. J. Perlis, A view of Programming Languages, Addison Wesley, 1970. | MR 272223 | Zbl 0234.68002

11. J. Katznelson, The Markox Algonthm as Language Parser: Linear Bounds, J. Comp. System Sc., Vol. 6, 1972, pp. 465-478. | Zbl 0247.68030

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

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

14. A. A. Markov, The Theory of Algortthms, Israel Program for Scientific Translations, Jérusalem, 1962. | MR 181560

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. | Numdam | MR 495201 | Zbl 0368.68056