Abstract
Markov algorithms have received very little attention in the studies about formal languages, so the purpose of the present paper is twofold: i) to characterize languages in terms of Markov algorithms, and ii) to produce automatically Markov algorithms accepting or parsing languages generated by given grammars.
We use a particular, although universal, subclass of Markov algorithms, which we call “pointer Markov algorithms»; we obtain a characterization of: i) regular, ii) deterministic context-free, and iii) type O languages, which is quite «natural» in terms of these algorithms. Furthermore, we show that, given a right linear or a strongLL(k) grammar, it is possible to produce automatically a pointer Markov algorithm parsing the language generated by the grammar. These constructions are particularly interesting because pointer Markov algorithms can be compiled conveniently into machine code programs.
Similar content being viewed by others
References
Markov A. A.,The theory of Algorithms (1961) Israel Program for Scientific Translation, Jerusalem.
De Bakker J. W.,Semantics of, programming languages, «Advances in Information System Sciences». (J. T. Tou, Ed.), vol. 2 (1969), Plenum Press, New York.
Arnold R. F. andRichards D. L.,Monotone congruence algorithms, Information and Control9 (1966), 285–297.
Katzenelson J.,The Markov algorithm as a language, parser—linear bounds, J. Comput. System Sci.6 (1972), 465–478.
Laganà M. R., Leoni G., Pinzani R. andSprugnoli R.,Improvements in the execution of Markov algorithms, Boll. UMI11 (1975), 473–489.
Aguzzi G., Pinzani R. andSprugnoli R.,An, algorithmic approach to the semantics of programming languages,in «Automata, Languages and Programming», (M. Nivat, Ed.) (1973) North Holland, Amsterdam.
Cerniavskii V. S.,On a class of normal Markov algorithms, AMS Translations (2)48 (1965), 1–25.
Leoni G. andSprugnoli R.,The compilation of pointer Markov algorithms,in «International Computing Symposium 1975», (E. Gelenbe and D. Potier, Eds.), (1975) North Holland, Amsterdam.
Ginsburg, S.,The Mathematical Theory of Context-free Languages, (1966) McGraw-Hill, New York.
Leoni G. andSprugnoli R.,Sull'efficienza di algoritmi di Markov compilati, Congresso A.I.C.A. 1975-Genova.
Aho A. V. andUllman J. D.,The Theory of Parsing, Translation, and Compiling, vol. 1 (1973), Prentice-Hall, Englewood Cliffs, N. J.,
Hopcroft J. E. andUllmann J. D.,Formal Languages and their Relations to Automata, (1969) addison Wesley, Reading, Ma.
Leoni G. andSprugnoli R.,Some relations between Markov algorithms and formal languages, I.S.I. Report S-76-4 (1976), Pisa.
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Leoni, G., Sprugoli, R. Some relations between Markov algorithms and formal languages. Calcolo 14, 261–284 (1977). https://doi.org/10.1007/BF02576816
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF02576816