Sheila A. Greibach
- Sheila A. Greibach. A new
normal-form theorem for context-free phrase structure grammars.
Journal of the ACM, 12(1):42-52, January 1965.
References
and Citations.
- Sheila A. Greibach. The
unsolvability of the recognition of linear context-free languages.
Journal of the ACM, 13(4):582-587, October 1966.
References
and Citations.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. Stack automata and
compiling. Journal of the ACM, 14(1):172-201, January
1967.
References
and Citations.
- Seymour Ginsburg, Sheila A. Greibach, and Michael A. Harrison. One-way stack automata.
Journal of the ACM, 14(2):389-418, April 1967.
References
and Citations.
- Sheila A. Greibach. An
infinite hierarchy of context-free languages. Journal of the
ACM, 16(1):91-106, January 1969.
References,
Citations,
etc.
- Sheila Greibach and Seymour Ginsburg. Multitape AFA. Journal
of the ACM, 19(2):193-221, April 1972.
References,
Citations,
etc.
- S. A. Greibach and E. P. Freidman. Superdeterministic PDAs: A
subcase with a decidable inclusion problem. Journal of the
ACM, 27(4):675-700, October 1980.
Shortcuts: