Some Remarks on State Grammars and Matrix Grammars

The context-free matrix grammar and the state grammar without any restriction in applying productions are considered. It turned out that these grammars are equivalent in the generative power. Another type of state grammar called the state grammar with unconditional transfer is introduced, and it is shown that each context-free matrix language is a homomorphic image of the intersection of a state language with unconditional transfer and a regular set.

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

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

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

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

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

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

[7]  Ivan Fris,et al.  Grammars with Partial Ordering of the Rules , 1968, Inf. Control..

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

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

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

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