The time and tape complexity of developmental languages
- 1 January 1977
- book chapter
- Published by Springer Nature
- p. 509-523
- https://doi.org/10.1007/3-540-08342-1_40
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- The tape-complexity of context-independent developmental languagesJournal of Computer and System Sciences, 1975
- The membership question for ETOL-languages is polynomially completeInformation Processing Letters, 1975
- On the size of dol languagesPublished by Springer Nature ,1974
- Notes on pre-set pushdown automataPublished by Springer Nature ,1974
- Parallelism in rewriting systemsPublished by Springer Nature ,1974
- The Hardest Context-Free LanguageSIAM Journal on Computing, 1973
- On 0L-LanguagesInformation and Control, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Path systems and language recognitionPublished by Association for Computing Machinery (ACM) ,1970
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965