Unconditional transfer in regulated rewriting

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].

[1]  Dietmar Wätjen.  k-limited OL Systems and Languages , 1988, J. Inf. Process. Cybern..

[2]  Derick Wood,et al.  Bicolored digraph grammar systems , 1973 .

[3]  Gheorghe Paun,et al.  Regulated Rewriting in Formal Language Theory , 1989 .

[4]  Henning Fernau,et al.  Scattered Context Grammars with Regulation , 1996 .

[5]  Juhani Karhumäki,et al.  A note on morphic characterization of languages , 1983, Discret. Appl. Math..

[6]  Grzegorz Rozenberg,et al.  Context-Free Grammars with Graph-Controlled Tables , 1976, J. Comput. Syst. Sci..

[7]  Arto Salomaa,et al.  Formal languages , 1973, Computer science classics.

[8]  Jürgen Dassow,et al.  A Remark on Limited OL Systems , 1988, J. Inf. Process. Cybern..

[9]  Jürgen Dassow,et al.  A undecidability result for regular anguages and its applications to regulated rewriting , 1989, Bull. EATCS.

[10]  Henning Fernau,et al.  Remarks on accepting parallel systems , 1995, Int. J. Comput. Math..

[11]  Daniel J. Rosenkrantz,et al.  Programmed Grammars and Classes of Formal Languages , 1969, JACM.

[12]  S. ABRAHAM,et al.  SOME QUESTIONS OF PHRASE STRUCTURE GRAMMARS, I , 1967 .

[13]  Gheorghe P un.  Normal forms for bicolored-digraph-grammar systems , 1979 .

[14]  Derick Wood.  A note on bicoloured digraph grammar systems , 1972 .

[15]  Arto Salomaa,et al.  Periodically Time-Variant Context-Free Grammars , 1970, Inf. Control..

[16]  Henning Fernau.  On Unconditional Transfer , 1996, MFCS.

[17]  Henning Fernau.  On Function-limited Lindenmayer Systems , 1991, J. Inf. Process. Cybern..

[18]  Henning Fernau.  A predicate for separating language classes , 1995, Bull. EATCS.

[19]  Henning Fernau,et al.  Remarks on Regulated Limited ET0L Systems and Regulated Context-Free Grammars , 1998, Theor. Comput. Sci..

[20]  Henning Fernau.  On Grammar and Language Families , 1996, Fundam. Informaticae.

[21]  Dietmar Wätjen,et al.  On Extended k-uniformly-limited T0L Systems and Languages , 1990, J. Inf. Process. Cybern..

[22]  Henning Fernau.  Membership for 1-Limited ET0L Languages Is Not Decidable , 1994, J. Inf. Process. Cybern..

[23]  Victor Mitrana,et al.  The modular grammars , 1989 .

[24]  Gheorghe Paun,et al.  On the planarity of bicolored digraph grammar systems , 1979, Discret. Math..

[25]  Gheorghe Paun,et al.  Grammar Systems: A Grammatical Approach to Distribution and Cooperation , 1995, ICALP.

[26]  Grzegorz Rozenberg,et al.  Context-Free Grammars with Graph Controlled Tables , 1975 .