Bibliography
- R. E. Stearns and J. Hartmanis, Regularity preserving modifications of regular expressions, Information and Control 6, (1963), 55-69. A first systematic study of language operations that preserve regular languages.
- Hartmanis, J.; Stearns, R. E. (1965), "On the computational complexity of algorithms", Transactions of the American Mathematical Society (American Mathematical Society) 117: 285–306, doi:10.2307/1994208, JSTOR 1994208, MR 0170805. Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory.
- R. E. Stearns: A Regularity Test for Pushdown Machines, Information and Control 11(3): 323-340 (1967). Answers a basic question about deterministic pushdown automata: it is decidable whether a given deterministic pushdown automaton accepts a regular language.
- P. M. Lewis II, R. E. Stearns: Syntax-Directed Transduction, Journal of the ACM 15(3): 465-488 (1968). Introduces LL parsers, which play an important role in compiler design.
Read more about this topic: Richard Stearns (computer Scientist)