Abstract.
In this paper, we investigate the concept of unconditional transfer within various forms of regulated grammars like programmed grammars, matrix grammars, grammars with regular control, grammars controlled by bicoloured digraphs, periodically time-variant grammars and variants thereof, especially regarding their descriptive capacity. In this way, we solve some problems from the literature. Furthermore, we correct a construction from the literature. Most of the results of the present paper have been announced in [11].
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Explore related subjects
Discover the latest articles and news from researchers in related subjects, suggested using machine learning.Author information
Authors and Affiliations
Additional information
Received: 19 July 1996 / 20 January 1997
Rights and permissions
About this article
Cite this article
Fernau, H. Unconditional transfer in regulated rewriting. Acta Informatica 34, 837–857 (1997). https://doi.org/10.1007/s002360050108
Issue Date:
DOI: https://doi.org/10.1007/s002360050108