Membership for Growing Context Sensitive Grammars is Polynomial

The membership problem for fixed context-sensitive languages is polynomial if the right hand side of every production is strictly longer than the left hand side.

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

[2]  Michael A. Harrison,et al.  Introduction to formal language theory , 1978 .

[3]  Ivan Hal Sudborough,et al.  On the Tape Complexity of Deterministic Context-Free Languages , 1978, JACM.

[4]  Jakob Gonczarowski,et al.  Applications of Scheduling Theory to Formal Language Theory , 1985, Theor. Comput. Sci..

[5]  Walter L. Ruzzo,et al.  Tree-Size Bounded Alternation , 1980, J. Comput. Syst. Sci..

[6]  Daniel H. Younger,et al.  Recognition and Parsing of Context-Free Languages in Time n^3 , 1967, Inf. Control..

[7]  Richard Edwin Stearns,et al.  Memory bounds for recognition of context-free and context-sensitive languages , 1965, SWCT.

[8]  Jakob Gonczarowski,et al.  Pattern Selector Grammars and Several Parsing Algorithms in the Context-Free Style , 1985, J. Comput. Syst. Sci..

[9]  Jacques Loeckx,et al.  The Parsing for General Phrase-Structure Grammars , 1970, Inf. Control..

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

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

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

[13]  Ronald V. Book.  Time-Bounded Grammars and Their Languages , 1971, J. Comput. Syst. Sci..

[14]  Stephen A. Cook.  Path systems and language recognition , 1970, STOC '70.

[15]  Jakob Gonczarowski,et al.  Manipulating Derivation Forests by Scheduling Techniques , 1986, Theor. Comput. Sci..