On Unconditional Transfer

. 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, and periodically time-variant grammars, especially regarding their descriptive capacity. Moreover, we sketch the relations to restricted parallel mechanisms like k-, uniformly k-, partition-, and function-limited ET0L systems, as well as (unordered) scattered context grammars. In this way, we solve a number of open problems from the literature. 1 Introduction Regulated rewriting is one of the main and classic topics of formal language theory [7, 28], since there, basically context-free rewriting mechanisms are enriched by different kinds of regulations (we restrict ourselves to context-free core rules in this paper), hence generally enhancing the generative power of such devices compared to the context-free languages. In this way, it is possible to describe..