The concept of a generalized Markov Algorithm is presented as basic tool for defining string processing languages. Previous work in this field is shortly summarized. Further extensions including from the one hand more powerful pattern recognition capabilities and from the other hand various approaches for handling multistring computations and introducing self–modifying capabilities are suggested. The problem of embedding the concept of a generalized Markov Algorithm into a general purpose programming language as well as the relation between this concept and others more or less independent approaches are also briefly considered and discussed.
