Size, index, and context-sensitivity of controlled partition grammars

Controlled partition grammars (CPGs) were designed to apply to certain needs of linguists. General CPGs generate exactly all context-sensitive languages. CPGs have two parameters:size andindex. The partition index of CPGs can be bounded by two, while CPGs with partition index one generate exactly the class of context-free languages. The size (of the partition blocks) of CPGs can be bounded by two, while CPGs of size one generate a class of languages properly contained in the class of contextsensitive languages. If one can eliminate recursive productions of the formA→B in a CPG then deterministic and nondeterministic lba's are equivalent.

[1]  Noam Chomsky,et al.  वाक्यविन्यास का सैद्धान्तिक पक्ष = Aspects of the theory of syntax , 1965 .

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

[3]  Armin B. Cremers.  Normal forms for context-sensitive grammars , 2004, Acta Informatica.

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

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

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

[7]  Walter J. Savitch,et al.  Relationships Between Nondeterministic and Deterministic Tape Complexities , 1970, J. Comput. Syst. Sci..

[8]  Alfred V. Aho.  Indexed Grammars-An Extension of Context Free Grammars , 1967, SWAT.

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

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

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

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

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

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

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

[16]  Jan van Leeuwen.  A partial solution to the reachability-problem for vector-addition systems , 1974, STOC '74.

[17]  P. Stanley Peters,et al.  On the generative power of transformational grammars , 1973, Inf. Sci..

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

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

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

[21]  Noam Chomsky,et al.  On Certain Formal Properties of Grammars , 1959, Inf. Control..

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

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

[24]  Seymour Ginsburg,et al.  A Mathematical Model of Transformational Grammars , 1969, Inf. Control..

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

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