Sheila Greibach is Professor Emeritus in the Computer Science Department at the University of California, Los Angeles (UCLA) Samueli School of Engineering. Born in New York City, she received her A.B. degree summa cum laude in Linguistics and Applied Mathematics from Radcliffe College in 1960, an A.M. degree from Radcliffe College in 1962, and a Ph.D. in Applied Mathematics from Harvard University in 1963. Her doctoral thesis was titled "Inverses of Phrase Structure Generators." She began her academic career serving on the faculty of Harvard's Division of Engineering and Applied Physics until 1969. That same year, Greibach joined the UCLA faculty and became a member of the Computer Science Department in 1970.

Greibach's research interests include algorithms and computational complexity, program schemes and semantics, formal languages and automata theory, and computability. She has contributed significantly to theoretical computer science, notably through her work on the Greibach normal form for context-free grammars, presented in her 1965 paper "A New Normal-Form Theorem for Context-Free Phrase Structure Grammars" published in the Journal of the ACM. Other important publications are "The Unsolvability of the Recognition of Linear Context-Free Languages" (Journal of the ACM, 1966), "An Infinite Hierarchy of Context-Free Languages" (Journal of the ACM, 1969), and "Stack Automata and Compiling" co-authored with Seymour Ginsburg and Michael A. Harrison (Journal of the ACM, 1967). She has taught courses such as Computer Science 181 on Formal Languages and Automata Theory. Her office is at 6266B Boelter Hall.

Professional Email: greibach@cs.ucla.edu