1. Autebert, J., Berstel, J., Boasson, L.: Context-free languages and push-down automata. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol. 1, pp. 111–174. Springer, Heidelberg (1997)
2. Bailey, C.: Inter-boundary scheduling of stack operands: a preliminary study. In: Proceedings of Euroforth Conference, pp. 3–11 (2000)
3. Bohm, C., Jacopini, G.: Nuove tecniche di programmazione semplificanti la sintesi di machine universali di Turing. Rend. Acc. Naz. Lincei, serie VIII, vol. 32 fasc. 6, p. 913-022 (1962)
4. Davis, M.: Computability and Unsolvability. McGraw-Hill, New York (1958)
5. Ginsburg, S., Greibach, S., Harrison, M.: Stack automata and compiling. JACM 14(1), 172–201 (1967)