1. J.C. Beatty. Two iteration theorems for the LL(k) languages. Theoretical Computer Science, 12: 193–228, 1980.
2. R.W. Floyd and R. Beigel. The Language of Machines: An Introduction to Computability and Formal Language Theory. Computer Science Press, San Francisco, CA, 1994.
3. J. Goldstine. Automata with data storage. In Proceedings of the Conference on Theoretical Computer Science, pages 239–246, Waterloo, Canada, 1977. University of Waterloo.
4. J. Goldstine. A rational theory of AFLs. In Proceedings of the Sixth Colloquium on Automata, Languages, and Programming, volume 71 of Lecture Notes in Computer Science, pages 271–281, New York, NY, 1979. Springer-Verlag.
5. J. Goldstine. Formal languages and their relation to automata: What Hopcroft & Ullman didn't tell us. In R.V. Book, editor, Formal Language Theory: Perspectives and Open Problems, pages 109–140, New York, NY, 1980. Academic Press.