1. The mathematical theory of context-free languages;Ginsburg,1966
2. Abstract families of languages;Ginsburg,1967
3. Stack automata and compiling;Ginsburg;J. Assoc. Computing Machinery,1967
4. S. Ginsburg and M. A. Harrison. On the elimination of endmarkers. To appear. Inform. and Control.
5. Two-way pushdown automata;Gray;Inform. Control,1967