Sheila Greibach
| Sheila Greibach | |
|---|---|
| Born |
October 6, 1939 New York City, New York, United States |
| Residence | California, United States |
| Fields |
Theoretical Computer Science Formal language in Computing Automata Computational Complexity Compiler Theory |
| Institutions |
University of California, Los Angeles Harvard University |
| Alma mater |
Radcliffe College Harvard University |
| Doctoral advisor | Anthony Oettinger |
| Doctoral students | Ronald V. Book, Michael J. Fischer, Jean Henri Gallier, Steven Lindell, Jose Rolim, Detlef Wotschke |
| Known for | Greibach normal form, Greibach's theorem |
Sheila Adele Greibach (born 6 October 1939 in New York City) is a researcher in formal languages in computing, automata, compiler theory (in particular), and computer science. She is an Emeritus Professor of Computer Science at the University of California, Los Angeles, and has worked with Seymour Ginsburg and Michael A. Harrison in context-sensitive parsing using the stack automaton model.
Besides establishing the normal form (Greibach normal form) for context-free grammars, in 1965, she also investigated properties of W-grammars, pushdown automata, and decidability problems.
Greibach earned in 1960 her A.B. degree from Radcliffe College in linguistics and applied mathematics (summa cum laude), and her A.M. degree in 1962 also from there. In 1963, she achieved her PhD at Harvard University, advised by Anthony Oettinger. The title of her PhD thesis is "Inverses of Phrase Structure Generators".
She continued to work at Harvard at the Division of Engineering and Applied Physics, until 1969 when she moved to the UCLA, where she has been professor since 1970 until present (as of March 2014).
...
Wikipedia