Normal forms for context-sensitive grammars

SummaryIn this paper, we mainly study the relation between scattered context grammars, which are an example for regulated context-free rewriting devices, and context-sensitive grammars. Emphasis is laid upon both normal form characterizations of context-sensitive grammars and an argument in how far scattered context grammars are stronger, with respect to generative capacity than unordered scattered context grammars.

[1]  Seymour Ginsburg,et al.  Control sets on grammars , 1968, Mathematical systems theory.

[2]  Andries P. J. van der Walt.  Random Context Languages , 1971, IFIP Congress.

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

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

[5]  Grzegorz Rozenberg.  Direction controlled programmed grammars , 2004, Acta Informatica.

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

[7]  Takumi Kasai,et al.  An Hierarchy Between Context-Free and Context-Sensitive Languages , 1970, J. Comput. Syst. Sci..

[8]  Ronald V. Book.  On the structure of context-sensitive grammars , 2004, International Journal of Computer & Information Sciences.

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

[10]  S.-Y. Kuroda,et al.  Classes of Languages and Linear-Bounded Automata , 1964, Inf. Control..

[11]  Azriel Rosenfeld,et al.  A Note on Scattered Context Grammars , 1971, Inf. Process. Lett..

[12]  Armin B. Cremers,et al.  On Vector Languages , 1974, J. Comput. Syst. Sci..

[13]  Armin B. Cremers,et al.  A Note on Leftmost Restricted Random Context Grammars , 1973, Inf. Process. Lett..

[14]  Arto Salomaa,et al.  Matrix Grammars with a Leftmost Restriction , 1972, Inf. Control..

[15]  Armin B. Cremers,et al.  On Matrix Languages , 1973, Inf. Control..

[16]  Hermann A. Maurer.  Simple Matrix Languages with a Leftmost Restriction , 1973, Inf. Control..

[17]  John E. Hopcroft,et al.  Scattered Context Grammars , 1969, J. Comput. Syst. Sci..

[18]  Seymour Ginsburg,et al.  The mathematical theory of context free languages , 1966 .

[19]  Otto Mayer,et al.  Some Restrictive Devices for Context-Free Grammars , 1972, Inf. Control..

[20]  Jeffrey D. Ullman,et al.  Formal languages and their relation to automata , 1969, Addison-Wesley series in computer science and information processing.