On the complexity of formal grammars
- 1 January 1978
- journal article
- Published by Springer Nature in Acta Informatica
- Vol. 9 (2) , 171-181
- https://doi.org/10.1007/bf00289076
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- General properties of derivational complexityActa Informatica, 1977
- Translational lemmas, polynomial time, and (log n)j-spaceTheoretical Computer Science, 1976
- Comparing complexity classesJournal of Computer and System Sciences, 1974
- Some restrictions onW-grammarsInternational Journal of Parallel Programming, 1974
- On the structure of context-sensitive grammarsInternational Journal of Parallel Programming, 1973
- On the extension of Gladkij's Theorem and the Hierarchies of languagesJournal of Computer and System Sciences, 1973
- Time-bounded grammars and their languagesJournal of Computer and System Sciences, 1971
- The complexity of theorem-proving proceduresPublished by Association for Computing Machinery (ACM) ,1971
- Checking automata and one-way stack languagesJournal of Computer and System Sciences, 1969
- Grammars with macro-like productionsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1968