Are you an EPFL student looking for a semester project?
Work with us on data science and visualisation projects, and deploy your project as an app on top of GraphSearch.
Concept
Sheila Greibach
Summary
Sheila Adele Greibach (born 6 October 1939 in New York City) is a 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.
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 an A.B. degree (summa cum laude) in Linguistics and Applied Mathematics from Radcliffe College in 1960, and two years after achieved an A.M. degree. In 1963, she was awarded a PhD at Harvard University, advised by Anthony Oettinger with a PhD thesis entitled "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 UCLA, where she has been a professor until present (as of March 2014).
Among her students were Ronald V. Book and Michael J. Fischer.
The following list indicates some of her work. 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
Every deterministic context-free language can be accepted by a deterministic finite delay pda with jumps. Increasing the number of types or occurrences of jumps increases the family of languages accepted with finite delay. Hence the family of deterministic context-free language is a principal AFDL; there is a context-free language such that every context-free language is an inverse gsm image of or .
"Some restrictions on W-grammars"
Proceedings of the sixth annual ACM symposium on Theory of computing, April 1974
The effect of some restrictions on W-grammars (the formalization of the syntax of ALGOL 68) are explored.
Official source
About this result
This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.