Complexity of some problems concerning L systems
- 1 January 1977
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 301-308
- https://doi.org/10.1007/3-540-08342-1_23
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- 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
- Word problems requiring exponential time(Preliminary Report)Published by Association for Computing Machinery (ACM) ,1973
- The equivalence problem for regular expressions with squaring requires exponential spacePublished by Institute of Electrical and Electronics Engineers (IEEE) ,1972
- Recognition and parsing of context-free languages in time n3Information and Control, 1967
- Memory bounds for recognition of context-free and context-sensitive languagesPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1965