no. 3
The theory of invertible algorithms
RAIRO. Informatique théorique, Tome 15 (1981) no. 3, pp. 253-279. 
@article{ITA_1981__15_3_253_0,
     author = {Aguzzi, Gianni},
     title = {The theory of invertible algorithms},
     journal = {RAIRO. Informatique th\'eorique},
     pages = {253--279},
     publisher = {EDP-Sciences},
     volume = {15},
     number = {3},
     year = {1981},
     mrnumber = {630065},
     zbl = {0476.68027},
     language = {en},
     url = {http://archive.numdam.org/item/ITA_1981__15_3_253_0/}
}
TY  - JOUR
AU  - Aguzzi, Gianni
TI  - The theory of invertible algorithms
JO  - RAIRO. Informatique théorique
PY  - 1981
SP  - 253
EP  - 279
VL  - 15
IS  - 3
PB  - EDP-Sciences
UR  - http://archive.numdam.org/item/ITA_1981__15_3_253_0/
LA  - en
ID  - ITA_1981__15_3_253_0
ER  - 
%0 Journal Article
%A Aguzzi, Gianni
%T The theory of invertible algorithms
%J RAIRO. Informatique théorique
%D 1981
%P 253-279
%V 15
%N 3
%I EDP-Sciences
%U http://archive.numdam.org/item/ITA_1981__15_3_253_0/
%G en
%F ITA_1981__15_3_253_0
Aguzzi, Gianni. The theory of invertible algorithms. RAIRO. Informatique théorique, Tome 15 (1981) no. 3, pp. 253-279. http://archive.numdam.org/item/ITA_1981__15_3_253_0/

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

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 | Zbl

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

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 | Zbl

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 | Zbl

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

7. A. Caracciolo Di Forino, L. Spanedda and N. Wolkenstein, Panon 1B: a Programming Language for Symbol Manipulation, Calcolo, 1966, pp. 245-255. | Zbl

8. V. S. Cerniavskii, On a Class of Normal Markov Algorithms, A.M.S. Translations, 2, Vol. 48, 1965, pp. 1-35. | Zbl

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

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

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

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 | Zbl

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 | Zbl

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

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 | Zbl