1. Aho, A.Y., Ullman, J.D., Hoperoft, J.E., On the computational power of pushdown automata, J.Comp.Syst.Sci. 4 (1970), 129–136
2. Cobham, A., The intrinsic computational complexity of functions, Proc. 1964 Int.Congr.Logic, Method. and Ph. of Sci., North Holland 1965, 24–30
3. Cook, S.A., Characterizations of pushdown machines in terms of time-bounded computers, J.Assoc.Comput.Mach. 18 (1971), 4–18
4. Cook, S.A., Linear time simulation of deterministic two-way pushdown automata, Information Processing 71, vol.1, Amsterdam–London 1972, 75–80
5. Monien, B., Relationships between pushdown automata with counters and complexity classes, to appear in Math.Syst.Th.