The theory of invertible algorithms

Gianni Aguzzi

RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications (1981)

  • Volume: 15, Issue: 3, page 253-279
  • ISSN: 0988-3754

How to cite

top

Aguzzi, Gianni. "The theory of invertible algorithms." RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications 15.3 (1981): 253-279. <http://eudml.org/doc/92144>.

@article{Aguzzi1981,
author = {Aguzzi, Gianni},
journal = {RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications},
keywords = {Markov algorithms; invertible pointer algorithms; bijective functions over recursive domains},
language = {eng},
number = {3},
pages = {253-279},
publisher = {EDP-Sciences},
title = {The theory of invertible algorithms},
url = {http://eudml.org/doc/92144},
volume = {15},
year = {1981},
}

TY - JOUR
AU - Aguzzi, Gianni
TI - The theory of invertible algorithms
JO - RAIRO - Theoretical Informatics and Applications - Informatique Théorique et Applications
PY - 1981
PB - EDP-Sciences
VL - 15
IS - 3
SP - 253
EP - 279
LA - eng
KW - Markov algorithms; invertible pointer algorithms; bijective functions over recursive domains
UR - http://eudml.org/doc/92144
ER -

References

top
  1. 1. G. AGUZZI, The Theory of Invertible Algorithms, Sem. Ist. Mat. Appl. Fac. Ing., Firenze, 1980. Zbl0476.68027MR630065
  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. Zbl0277.68011MR351143
  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. Zbl0272.68011
  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. Zbl0297.68053MR445896
  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. Zbl0262.68007MR388825
  6. 6. A. CARACCIOLO DI FORINO, Generalized Markov Algorithms and Automata, in Automata Theory, CAIANIELLO, Ed., Academic Press, New York. Zbl0192.06302
  7. 7. A. CARACCIOLO DI FORINO, L. SPANEDDA and N. WOLKENSTEIN, Panon 1B: a Programming Language for Symbol Manipulation, Calcolo, 1966, pp. 245-255. Zbl0221.68031
  8. 8. V. S. CERNIAVSKII, On a Class of Normal Markov Algorithms, A.M.S. Translations, 2, Vol. 48, 1965, pp. 1-35. Zbl0148.24802
  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 Zbl0117.12201
  10. 10. B. A. GALLER and A. J. PERLIS, A view of Programming Languages, Addison Wesley, 1970. Zbl0234.68002MR272223
  11. 11. J. Katznelson, The Markox Algonthm as Language Parser: Linear Bounds, J. Comp. System Sc., Vol. 6, 1972, pp. 465-478. Zbl0247.68030
  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. Zbl0323.68030MR387038
  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. Zbl0324.68014MR483641
  14. 14. A. A. MARKOV, The Theory of Algortthms, Israel Program for Scientific Translations, Jérusalem, 1962. MR181560
  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. Zbl0368.68056MR495201

NotesEmbed ?

top

You must be logged in to post comments.

To embed these notes on your page include the following JavaScript code on your page where you want the notes to appear.

Only the controls for the widget will be shown in your chosen language. Notes will be shown in their authored language.

Tells the widget how many notes to show per page. You can cycle through additional notes using the next and previous controls.

    
                

Note: Best practice suggests putting the JavaScript code just before the closing </body> tag.