Sheila Greibach
Affiliations: | Computer Science | University of California, Los Angeles, Los Angeles, CA |
Area:
algorithms and computational complexity; program schemes and semantics; formal languages and automata theory and computabilityGoogle:
"Sheila Greibach"Bio:
Children
Sign in to add trainee| Michael Fischer | grad student | 1968 | Harvard |
| Sandra L. Batista | grad student | 2009 | UCLA |
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Rolim JDP, Greibach SA. (1988) On the IO-complexity and approximation languages Information Processing Letters. 28: 27-31 |
| Greibach SA. (1981) Formal Languages: Origins and Directions Annals of the History of Computing. 3: 14-41 |
| Book RV, Greibach SA, Wrathall C. (1979) Reset machines Journal of Computer and System Sciences. 19: 256-276 |
| Greibach SA. (1978) Comments on universal and left universal grammars, context-sensitive languages, and context-free grammar forms Information and Control. 39: 135-142 |
| Friedman EP, Greibach SA. (1978) On equivalence and subclass containment problems for deterministic context-free languages Information Processing Letters. 7: 287-290 |
| Greibach SA. (1978) Hierarchy theorems for two-way finite state transducers Acta Informatica. 11: 89-101 |
| Greibach SA. (1977) Control sets on context-free grammar forms Journal of Computer and System Sciences. 15: 35-98 |
| Greibach SA. (1977) NOTE ON NSPACE(log//2 n) AND SUBSTITUTION Rairo Inf Theor Theor Comput Sci. 11: 127-132 |
| Greibach SA. (1975) A Remark on Code Sets and Context-Free Languages Ieee Transactions On Computers. 741-742 |
| Greibach SA. (1975) One counter languages and the IRS condition Journal of Computer and System Sciences. 10: 237-247 |