Richard Stearns
Za ostale osobe s istim imenom, v. Richard Stearns (razvrstavanje).Richard Edwin Stearns (5. jul 1936 -) je američki informatičar, najpoznatiji po radu na računskoj teoriji složenosti, za koji je godine 1993. zajedno sa Jurisom Hartmanisom dobio Turingovu nagradu.
| Richard Edwin Stearns | |
 | |
| Rođenje | 5. 7. 1936. |
|---|---|
| Alma mater | Princeton University |
| Akademski mentor | Harold W. Kuhn |
| Istaknute nagrade | ACM-ova Turingova nagrada (1993) |
Bibliografija uredi
- 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.
- Hartmanis, J.; Stearns, R. E. (May 1965), „On the computational complexity of algorithms”, Transactions of the American Mathematical Society (American Mathematical Society) 117: 285–306, JSTOR 1994208, 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, DOI:10.1016/S0019-9958(67)90591-8. Answers a basic question about 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, DOI:10.1145/321466.321477. Introduces LL parsers, which play an important role in compiler design.
Vanjske veze uredi
- Richard Stearns na sajtu Mathematics Genealogy Project (en)
- DBLP entry Arhivirano 2012-10-17 na Wayback Machine-u
- Personal homepage Arhivirano 2019-06-04 na Wayback Machine-u at the University at Albany