Age, Biography and Wiki
Sheila Greibach was born on 6 October, 1939 in New York City, New York, United States, is an American computer scientist. Discover Sheila Greibach's Biography, Age, Height, Physical Stats, Dating/Affairs, Family and career updates. Learn How rich is she in this year and how she spends money? Also learn how she earned most of networth at the age of 84 years old?
| Popular As |
N/A |
| Occupation |
N/A |
| Age |
84 years old |
| Zodiac Sign |
Libra |
| Born |
6 October, 1939 |
| Birthday |
6 October |
| Birthplace |
New York City, New York, United States |
| Nationality |
United States
|
We recommend you to check the complete list of Famous People born on 6 October.
She is a member of famous computer with the age 84 years old group.
Sheila Greibach Height, Weight & Measurements
At 84 years old, Sheila Greibach height not available right now. We will update Sheila Greibach's Height, weight, Body Measurements, Eye Color, Hair Color, Shoe & Dress size soon as possible.
| Physical Status |
| Height |
Not Available |
| Weight |
Not Available |
| Body Measurements |
Not Available |
| Eye Color |
Not Available |
| Hair Color |
Not Available |
Dating & Relationship status
She is currently single. She is not dating anyone. We don't have much information about She's past relationship and any previous engaged. According to our Database, She has no children.
| Family |
| Parents |
Not Available |
| Husband |
Not Available |
| Sibling |
Not Available |
| Children |
Not Available |
Sheila Greibach Net Worth
Her net worth has been growing significantly in 2023-2024. So, how much is Sheila Greibach worth at the age of 84 years old? Sheila Greibach’s income source is mostly from being a successful computer. She is from United States. We have estimated Sheila Greibach's net worth, money, salary, income, and assets.
| Net Worth in 2024 |
$1 Million - $5 Million |
| Salary in 2024 |
Under Review |
| Net Worth in 2023 |
Pending |
| Salary in 2023 |
Under Review |
| House |
Not Available |
| Cars |
Not Available |
| Source of Income |
computer |
Sheila Greibach Social Network
| Instagram |
|
| Linkedin |
|
| Twitter |
|
| Facebook |
|
| Wikipedia |
|
| Imdb |
|
Timeline
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.
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".
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.
"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
"Stack automata and compiling," co-authored with Seymour Ginsburg and Michael A. Harrison, "JACM", January 1967, Volume 14 Issue 1
"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)"
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.
"An Infinite Hierarchy of Context-Free Languages," Journal of the ACM, Volume 16 Issue 1, January 1969
"Quasi-realtime languages (Extended Abstract)," co-authored with Ronald V. Book, Proceedings of the first annual ACM symposium on Theory of Computing, May 1969
co-authored with Ronald V. Book and Ben Wegbreit, Proceedings of the second annual ACM symposium on Theory of computing, May 1970
"Multitape AFA," co-authored with Seymour Ginsburg, Journal of the ACM, Volume 19 Issue 2, April 1972
"Uniformly erasable AFL", co-authored with Seymour Ginsburg and Jonathan Goldstine, Proceedings of the fourth annual ACM symposium on Theory of computing, May 1972
"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
"Superdeterministic PDAs: A Subcase with a Decidable Inclusion problem", co-authored with E. P. Friedman, "JACM", October 1980, Volume 27 Issue 4
