Alt, H.; Mehlhorn, K. Lower bounds for the space complexity of context-free recognition. (English) Zbl 0368.68069 Automata, languages and programming, 3rd int. Collog. Edinburgh 1976, 338-354 (1976). MSC: 68Q45 68Q25 03D10 PDFBibTeX XML
Mehlhorn, Kurt Polynomial and abstract subrecursive classes. (English) Zbl 0329.68049 J. Comput. Syst. Sci. 12, 147-178 (1976). MSC: 68Q25 68W99 68Q45 03D20 03D25 PDFBibTeX XMLCite \textit{K. Mehlhorn}, J. Comput. Syst. Sci. 12, 147--178 (1976; Zbl 0329.68049) Full Text: DOI
Mehlhorn, Kurt Polynomial and abstract subrecursive classes. (English) Zbl 0363.68063 Proc. 6th ann. ACM Symp. Theory Comput., Seattle 1974, 96-109 (1974). MSC: 68Q25 03D20 PDFBibTeX XML
Mehlhorn, Kurt The ’almost all’ theory of subrecursive degrees is decidable. (English) Zbl 0284.68041 Automata, Languages, Progr.; 2nd Colloqu., Univ. Saarbrücken, Lecture Notes Computer Sci. 14, 317-325 (1974). MSC: 68Q25 03D30 03B25 PDFBibTeX XML