Sheila Adele Greibach (born 6 October 1939 in New York City) is an American researcher in formal languages in computing, automata, compiler theory and computer science.
She is an Emeritus Professor of Computer Science at the University of California, Los Angeles, and notable work include working with Seymour Ginsburg and Michael A. Harrison in context-sensitive parsing using the stack automaton model.
She continued to work at Harvard at the Division of Engineering and Applied Physics until 1969, when she moved to UCLA, where she has been a professor until the present (as of March 2014).
The top portion of the list is from the ACM Digital Library and the remainder from the FOCS Bibliography by David M. Jones.
"Jump PDA's, deterministic context-free languages, principal AFDLs and polynomial time recognition (Extended Abstract)," Proceedings of the fifth annual ACM symposium on Theory of Computing, April 1973 "Some restrictions on W-grammars" Proceedings of the sixth annual ACM symposium on Theory of computing, April 1974 "An Infinite Hierarchy of Context-Free Languages," Journal of the ACM, Volume 16 Issue 1, January 1969 "A New Normal-Form Theorem for Context-Free Phrase Structure Grammars," JACM, Volume 12 Issue 1, January 1965 "The Unsolvability of the Recognition of Linear Context-Free Languages," JACM, Volume 13 Issue 4, October 1966 "Multitape AFA," co-authored with Seymour Ginsburg, Journal of the ACM, Volume 19 Issue 2, April 1972 "Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem", co-authored with E. P. Friedman, "JACM", October 1980, Volume 27 Issue 4 "Stack automata and compiling," co-authored with Seymour Ginsburg and Michael A. Harrison, "JACM", January 1967, Volume 14 Issue 1 "Quasi-realtime languages (Extended Abstract)," co-authored with Ronald V. Book, Proceedings of the first annual ACM symposium on Theory of Computing, May 1969 "One-way stack automata," co-authored with Seymour Ginsburg and Michael A. Harrison, "JACM", April 1967, Volume 14 Issue 2 "Tape- and time-bounded Turing acceptors and AFLs (Extended Abstract)" co-authored with Ronald V. Book and Ben Wegbreit, Proceedings of the second annual ACM symposium on Theory of computing, May 1970 "Uniformly erasable AFL", co-authored with Seymour Ginsburg and Jonathan Goldstine, Proceedings of the fourth annual ACM symposium on Theory of computing, May 1972