Richard E. Stearns
Richard Edwin Stearns | |
---|---|
University at Albany | |
Doctoral advisor | Harold W. Kuhn |
Richard Edwin Stearns (born July 5, 1936) is an American
Fellow of the Association for Computing Machinery
.
Stearns graduated with a B.A. in
University at Albany, which is part of the State University of New York.[4]
Bibliography
- Stearns, R.E.; Hartmanis, J. (March 1963), "Regularity preserving modifications of regular expressions", Information and Control, 6 (1): 55–69, doi:10.1016/S0019-9958(63)90110-4. A first systematic study of language operations that preserve regular languages.
- MR 0170805. Contains the time hierarchy theorem, one of the theorems that shaped the field of computational complexity theory.
- Stearns, R.E. (September 1967), "A Regularity Test for Pushdown Machines", Information and Control, 11 (3): 323–340, deterministic pushdown automata: it is decidable whether a given deterministic pushdown automaton accepts a regular language.
- Lewis II, P.M.; Stearns, R.E. (1968), "Syntax-Directed Transduction", Journal of the ACM, 15 (3): 465–488, compiler design.
References
- ^ Lewis, Philip M. "Richard ("Dick") Edwin Stearns". AMTuring.ACM.org. Association for Computing Machinery. Retrieved 10 March 2019.
- ^ "Richard E Stearns - A.M. Turing Award Laureate". amturing.acm.org. Retrieved 2020-06-18.
- ^ Stearns, Richard Edwin (1961). Three person cooperative games without side payments.
- ^ "Richard E. Stearns". IEEE Xplore. Retrieved 2024-02-15.
External links
- Official website
- Richard Edwin Stearns at DBLP Bibliography Server
- Richard Edward Stearns at the Mathematics Genealogy Project