C. Choffrut and K. Culik, Properties of Finite and Pushdown Transducers, SIAM Journal on Computing, vol.12, issue.2, pp.300-315, 1983.
DOI : 10.1137/0212019

R. J. Evey, Application of pushdown-store machines, Proceedings of the November 12-14, 1963, fall joint computer conference on XX, AFIPS '63 (Fall), pp.215-227, 1963.
DOI : 10.1145/1463822.1463848

P. C. Fisher, On computability by certain classes of restricted turing machines, Proceedings of the Fourth Annual Symposium on Switching Circuit Theory and Logical Design (swct 1963), pp.23-32, 1963.
DOI : 10.1109/SWCT.1963.10

J. E. Hopcroft, R. Motwani, and J. D. Ullman, Introduction to Automata Theory , Languages, and Computation. Second Edittion, 2001.
DOI : 10.1145/568438.568455

K. Kobayashi, Classification of formal languages by functional binary transductions, Information and Control, vol.15, issue.1, pp.95-109, 1969.
DOI : 10.1016/S0019-9958(69)90651-2

S. Konstantinidis, N. Santean, and S. Yu, Representation and uniformization of algebraic transductions, Acta Informatica, vol.18, issue.1, pp.395-417, 2007.
DOI : 10.1007/s00236-006-0027-7

A. L. Selman, A taxonomy of complexity classes of functions, Journal of Computer and System Sciences, vol.48, issue.2, pp.357-381, 1994.
DOI : 10.1016/S0022-0000(05)80009-1

A. L. Selman, Much ado about functions, Proceedings of Computational Complexity (Formerly Structure in Complexity Theory), pp.198-212, 1996.
DOI : 10.1109/CCC.1996.507682
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.138.7240

K. Tadaki, T. Yamakami, and J. C. Lin, Theory of one-tape linear-time Turing machines An extended abstract appeared in SOFSEM, Theoret. Comput. Sci. LNCS, vol.4112932, pp.22-43335, 2004.

T. Yamakami, Swapping lemmas for regular and context-free languages Available at arXiv:0808, 2008.

T. Yamakami, Pseudorandom generators against advised context-free languages, Theoretical Computer Science, vol.613, 2009.
DOI : 10.1016/j.tcs.2015.10.026
URL : http://arxiv.org/abs/0902.2774

T. Yamakami, Immunity and pseudorandomness of context-free languages, Theoretical Computer Science, vol.412, issue.45, pp.6432-6450, 2011.
DOI : 10.1016/j.tcs.2011.07.013

T. Yamakami, Oracle Pushdown Automata, Nondeterministic Reducibilities, and the Hierarchy over the Family of Context-Free Languages, Proc. 40th of SOF- SEM 2014, pp.514-525, 2014.
DOI : 10.1007/978-3-319-04298-5_45

T. Yamakami, Structural complexity of multi-valued partial functions computed by nondeterministic pushdown automata. Unpublished manuscript, 2014.