A Note on the Complexity of General $D0L$ Membership
- 1 February 1981
- journal article
- Published by Society for Industrial & Applied Mathematics (SIAM) in SIAM Journal on Computing
- Vol. 10 (1) , 114-117
- https://doi.org/10.1137/0210009
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- Complexity of some problems concerningL systemsTheory of Computing Systems, 1979
- The time and tape complexity of developmental languagesPublished by Springer Nature ,1977
- Space-bounded reducibility among combinatorial problemsJournal of Computer and System Sciences, 1975
- On the size of dol languagesPublished by Springer Nature ,1974