Characterization of some classes of context-free languages in terms of complexity classes
- 1 January 1975
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
Abstract
No abstract availableThis publication has 4 references indexed in Scilit:
- An Overview of the Theory of Computational ComplexityJournal of the ACM, 1971
- Characterizations of Pushdown Machines in Terms of Time-Bounded ComputersJournal of the ACM, 1971
- Computational Complexity of One-Tape Turing Machine ComputationsJournal of the ACM, 1968
- A Machine-Independent Theory of the Complexity of Recursive FunctionsJournal of the ACM, 1967