Relationships between nondeterministic and deterministic tape complexities

A Machine-Independent Theory of the Complexity of Recursive Functions

Manuel Blum · Journal of the ACM · 1967 · 835 citations · Full text

Computing, Computer Science, Algorithms +11

Classes of languages and linear-bounded automata

S.-Y. Kuroda · Information and Control · 1964 · 271 citations

Computing, Computer Science, Mathematics +11

Memory bounds for recognition of context-free and context-sensitive languages

Philip Lewis, Richard E. Stearns, Juris Hartmanis · 1965 · 220 citations

Computing, Computer Science, Algorithms +15

The recognition problem for the set of perfect squares

Alan Cobham · Annual Symposium on Switching & Automata Theory · 1966 · 100 citations

Computing, Computer Science, Mathematics +10

Three theorems on phrase structure grammars of type 1

Peter S. Landweber · Information and Control · 1963 · 65 citations

Language Studies, Computer Science, Formal Methods +13