1. N. Chomsky, Context-Free Grammars and Pushdown Storage (Research Laboratory of Electronics, Massachusetts Institute of Technology, Cambridge, Mass, 1962).
2. R. J. Evey, “Applications of Pushdown-Store Machines,” in Proc. AFIPS Fall Joint Computer Conf. Vol. 24 (Las Vegas, 1963), pp. 215–227.
3. S. Ginsburg and G. F. Rose, “Some Recursively Unsolvable Problems in ALGOL-like Languages,” J. Assoc. Comput. Mach. 10, 175 (1963).
4. S. Ginsburg and S. Greibach, “Deterministic Context Free Languages,” Inform. and Contr. 9 (6), 620 (1966).
5. D. N. Babin, “On Completeness of the Binary Boundedly Determined Functions with Respect to Superposition,” Diskret. Matem. 1 (4), 86 (1989) [Discrete Math. Appl. 1 (4), 423 (1991)].