Some relations between Markov algorithms and formal languages - Calcolo
link.springer.com/article/10.1007/BF02576816Markov 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.
A Markov Algorithm Interpreter
www.tandfonline.com/doi/abs/10.1080/0020739730040216In the study of fundamental properties of algorithms, attention is often given to classes of abstract general procedures. Of these, the Markov algorithm has some claims to favour owing to the simplicity of its semantics, the relative power of its basic operations and its independence of numerical concepts. Such a study will generally be assisted by some practical experience in using the methods introduced.