{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,3,29]],"date-time":"2023-03-29T07:47:16Z","timestamp":1680076036418},"reference-count":15,"publisher":"EDP Sciences","issue":"3","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["RAIRO. Inform. th\u00e9or."],"published-print":{"date-parts":[[1981]]},"DOI":"10.1051\/ita\/1981150302531","type":"journal-article","created":{"date-parts":[[2017,2,6]],"date-time":"2017-02-06T15:43:39Z","timestamp":1486395819000},"page":"253-279","source":"Crossref","is-referenced-by-count":2,"title":["The theory of invertible algorithms"],"prefix":"10.1051","volume":"15","author":[{"given":"Gianni","family":"Aguzzi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"250","published-online":{"date-parts":[[2011,1,8]]},"reference":[{"key":"R1","unstructured":"1. AGUZZI G., The Theory of Invertible Algorithms, Sem. Ist. Mat. Appl. Fac. Ing., Firenze, 1980.0476.68027630065"},{"key":"R2","doi-asserted-by":"crossref","unstructured":"2. AGUZZI G., CESARINI F., PINZANI R., SODA G. and SPRUGNOLI R., Towards an Automatic Generation of Interpreters, in Lecture Notes in Computer Science, vol.1, 1973, pp. 94-103, Springer-Verlag, Berlin.3511430277.68011","DOI":"10.1007\/978-3-662-41148-3_9"},{"key":"R3","unstructured":"3. AGUZZI G., CESARINI F., PINZANI R., SODA G. and SPRUGNOLI R., An APL Implementation of an Interpreter Writing System, in APL Congress 73, 1973, pp. 9-15, North-Holland Pub. Co., Amsterdam.0272.68011"},{"key":"R4","doi-asserted-by":"crossref","unstructured":"4. AGUZZI G., CESARINI F., PINZANI R., SODA G. and SPRUGNOLI R., Tree Structures Handling by APS, in Lecture Notes in Computer Science, Vol. 19, 1974, pp. 120-129, Springer-Verlag, Berlin.4458960297.68053","DOI":"10.1007\/3-540-06859-7_129"},{"key":"R5","unstructured":"5. AGUZZI G., PINZANI R. and SPRUGNOLI R., 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.3888250262.68007"},{"key":"R6","unstructured":"6. CARACCIOLO DI FORINO A., Generalized Markov Algorithms and Automata, in Automata Theory, CAIANIELLO, Ed., Academic Press, New York.0192.06302"},{"key":"R7","doi-asserted-by":"crossref","unstructured":"7. CARACCIOLO DI FORINO A., SPANEDDA L. and WOLKENSTEIN N., Panon 1B: a Programming Language for Symbol Manipulation, Calcolo, 1966, pp. 245-255.0221.68031","DOI":"10.1007\/BF02575695"},{"key":"R8","doi-asserted-by":"crossref","unstructured":"8. CERNIAVSKII V. S., On a Class of Normal Markov Algorithms, A.M.S. Translations, 2, Vol. 48, 1965, pp. 1-35.0148.24802","DOI":"10.1090\/trans2\/048\/01"},{"key":"R9","doi-asserted-by":"crossref","unstructured":"9. FARBER D. J., GRISWOLD R. E. and POLONSKY I. P., Snobol, a String Manipulation Language, J. Assoc. Comp. Mach., vol. 11, 1964, pp. 21-300117.12201","DOI":"10.1145\/321203.321207"},{"key":"R10","unstructured":"10. GALLER B. A. and PERLIS A. J., A view of Programming Languages, Addison Wesley, 1970.2722230234.68002"},{"key":"R11","doi-asserted-by":"crossref","unstructured":"11. Katznelson J., The Markox Algonthm as Language Parser: Linear Bounds, J. Comp. System Sc., Vol. 6, 1972, pp. 465-478.0247.68030","DOI":"10.1016\/S0022-0000(72)80014-X"},{"key":"R12","unstructured":"12. LAGAN\u00c0 M. R., LEONI G., PINZANI R. and SPRUGNOLI R., Improvements in the Execution of Markov Algorithms, Boll. Un. Mat. Italiana, Vol. 11, (4), 1975, pp. 473-489.3870380323.68030"},{"key":"R13","unstructured":"13. LEONI G. and SPRUGNOLI R., 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.4836410324.68014"},{"key":"R14","unstructured":"14. MARKOV A. A., The Theory of Algortthms, Israel Program for Scientific Translations, J\u00e9rusalem, 1962.181560"},{"key":"R15","doi-asserted-by":"crossref","unstructured":"15. PAGET M., Propri\u00e9t\u00e9s de Complexit\u00e9 pour une Famille d'Algorithmes de Markov, R.A.I.R.O. informatique th\u00e9orique, Vol. 12, (1), 1978, pp. 15-32.920614952010368.68056","DOI":"10.1051\/ita\/1978120100151"}],"container-title":["RAIRO. Informatique th\u00e9orique"],"original-title":[],"link":[{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1981150302531\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,9,18]],"date-time":"2019-09-18T09:35:49Z","timestamp":1568799349000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.rairo-ita.org\/10.1051\/ita\/1981150302531"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"references-count":15,"journal-issue":{"issue":"3"},"alternative-id":["ita1981150302531"],"URL":"https:\/\/doi.org\/10.1051\/ita\/1981150302531","relation":{},"ISSN":["0399-0540"],"issn-type":[{"value":"0399-0540","type":"print"}],"subject":[],"published":{"date-parts":[[1981]]}}}