Role Model Sunday: Sheila Greibach

This, err, last week’s role model was pointed out to me – and about 180 other students – by our teacher in Theoretical Informatics and Logic (I might even write about her at some point): Sheila Greibach, researcher in formal languages, compiler theory and computer science.

Sheila Greibach [source 1=”http://cs.ucla.edu” language=”:”][/source]
In the context of the TIL lecture, Sheila Greibach was mentioned for establishing the normal form (aka Greibach normal form) for context-free grammars.  She also works on properties of pushdown automata, and decidability problems.

After earning her A.B. and A.M. degrees at Radcliffe University in 1960 and 1962, she achieved her PhD at Harvard University in 1963. 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 she moved to the UCLA, where she has been professor since 1970.

Other than the Greibach normal form, she is also known for Greibach’s theorem, stating that certain properties of formal language classes are undecidable.

More information on Sheila Greibach can be found at wikipedia.

Leave a Reply