Membership for growing context-sensitive grammars is polynomial
- 1 December 1986
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 33 (3) , 456-472
- https://doi.org/10.1016/0022-0000(86)90062-0
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Pattern selector grammars and several parsing algorithms in the context-free styleJournal of Computer and System Sciences, 1985
- Tree-size bounded alternationJournal of Computer and System Sciences, 1980
- On the Tape Complexity of Deterministic Context-Free LanguagesJournal of the ACM, 1978
- On the complexity of formal grammarsActa Informatica, 1978
- On the structure of context-sensitive grammarsInternational Journal of Parallel Programming, 1973
- Time-bounded grammars and their languagesJournal of Computer and System Sciences, 1971
- The parsing for general phrase-structure grammarsInformation and Control, 1970
- Scattered context grammarsJournal of Computer and System Sciences, 1969
- Classes of languages and linear-bounded automataInformation and Control, 1964
- On certain formal properties of grammarsInformation and Control, 1959