Z. Bednárová, V. Geffert, C. Mereghetti, and B. Palano, The size-cost of Boolean operations on constant height deterministic pushdown automata, Theoret. Comput. Sci, vol.449, pp.23-36, 2012.

H. Bordihn, H. Fernau, M. Holzer, V. Manca, and C. Martín-vide, Iterated sequential transducers as language generating devices, Theoret. Comput. Sci, vol.369, issue.1-3, pp.67-81, 2006.

C. Citrini, S. Crespi-reghizzi, and D. Mandrioli, On deterministic multi-pass analysis, SIAM J. Comput, vol.15, issue.3, pp.668-693, 1986.

N. Friburger and D. Maurel, Finite-state transducer cascades to extract named entities in texts, Theoret. Comput. Sci, vol.313, issue.1, pp.93-104, 2004.

Y. Gao, N. Moreira, R. Reis, and S. Yu, A survey on operational state complexity, J. Autom., Lang. Comb, vol.21, issue.4, pp.251-310, 2017.

A. Ginzburg, Algebraic theory of automata, 1968.

J. Hartmanis, Computational complexity of one-tape Turing machine computations, J. ACM, vol.15, issue.2, pp.325-339, 1968.

J. Hartmanis and R. E. Stearns, Algebraic structure theory of sequential machines, 1966.

M. Holzer and M. Kutrib, Descriptional complexity -An introductory survey, Scientific Applications of Language Methods, pp.1-58, 2010.

N. D. Jones, Space-bounded reducibility among combinatorial problems, J. Comput. System Sci, vol.11, pp.68-85, 1975.

N. D. Jones and W. T. Laaser, Complete problems for deterministic polynomial time, Theoret. Comput. Sci, vol.3, pp.105-117, 1976.

A. Malcher, C. Mereghetti, and B. Palano, Descriptional complexity of two-way pushdown automata with restricted head reversals, Theoret. Comput. Sci, vol.449, pp.119-133, 2012.

V. Manca, On the generative power of iterated transductions, Words, Semigroups, and Transductions -Festschrift in Honor of Gabriel Thierrin, pp.315-327, 2001.

G. H. Mealy, A method for synthesizing sequential circuits. Bell System Tech, J, vol.34, pp.1045-1079, 1955.

A. Pierce, Decision Problems on Iterated Length-Preserving Transducers. Bachelor's thesis, 2011.

A. Salomaa, D. Wood, and S. Yu, On the state complexity of reversals of regular languages, Theoret. Comput. Sci, vol.320, pp.315-329, 2004.