Summary
It is shown that for every recursively enumerable language L \( \subseteq \)∑* there exists a selective substitution grammar with a regular selector over a binary alphabet that generates L¢5, where ¢∉∑.
By requiring additional structural properties of the (already simple) selectors the language generating power is reduced in such a way that the resulting class lies strictly in between the family of EOL languages and the family of context-sensitive languages.
For this class of languages some decision problems and normal forms are considered.
Similar content being viewed by others
References
Ehrenfeucht, A., Rozenberg, G., Verraedt, R.: A combinatorial Property of EOL Languages. Techn. Rep. 82-23, Department of Mathematics, University of Antwerp, U.I.A., 1982
Gonczarowski, J., Kleijn, H.C.M., Rozenberg, G.: Closure Properties of Selective Substitution Grammars. Part 1 and part 2, Int. J. Comp. Math. (to appear)
Kleijn, H.C.M., Rozenberg, G.: Context-free like Restrictions on Selective Rewriting. Theor. Comp. Sci. 16, 237–269 (1981)
Minsky, M.L.: Recursive Unsolvability of Post's Problem of “TAG” and Other Topics in Theory of Turing Machines. Ann. Math. 74, 437–455 (1961)
Rosenkrantz, D.J.: Programmed Grammars and Classes of Formal Languages. J. A.C.M. 16, 107–131 (1969)
Rozenberg, G., Salomaa, A.: The Mathematical Theory of L Systems. New York: Academic Press, 1980
Salomaa, A.: Formal Languages. New York: Academic Press, 1973
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Kleijn, H.C.M., Rozenberg, G. On the generative power of regular pattern grammars. Acta Informatica 20, 391–411 (1983). https://doi.org/10.1007/BF00264281
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF00264281