Complexity of some problems concerningL systems
- 1 December 1979
- journal article
- research article
- Published by Springer Nature in Theory of Computing Systems
- Vol. 13 (1) , 29-43
- https://doi.org/10.1007/bf01744286
Abstract
No abstract availableKeywords
This publication has 14 references indexed in Scilit:
- Recognition of deterministic ETOL languages in logarithmic spaceInformation and Control, 1977
- The time and tape complexity of developmental languagesPublished by Springer Nature ,1977
- Complexity of some problems concerning L systemsLecture Notes in Computer Science, 1977
- Complete problems for deterministic polynomial timeTheoretical Computer Science, 1976
- The tape-complexity of context-independent developmental languagesJournal of Computer and System Sciences, 1975
- A Note on Tape-Bounded Complexity Classes and Linear Context-Free languagesJournal of the ACM, 1975
- The membership question for ETOL-languages is polynomially completeInformation Processing Letters, 1975
- General context-free recognition in less than cubic timeJournal of Computer and System Sciences, 1975
- Three useful results concerning L languages without interactionsPublished by Springer Nature ,1974
- Recognition and parsing of context-free languages in time n3Information and Control, 1967