R. Alur and P. Madhusudan, Adding nesting structure to words, J. ACM, vol.56, p.16, 2009.
DOI : 10.1145/1516512.1516518
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.145.9971

B. Von-braunmühl and R. Verbeek, Input-driven languages are recognized in log n space In: Fundamentals of Computation Theory (FCT 1983), LNCS, vol.158, pp.40-51, 1983.

P. Chervet and I. Walukiewicz, Minimizing Variants of Visibly Pushdown Automata, In: Mathematical Foundations of Computer Science LNCS, vol.4708, pp.135-146, 2007.
DOI : 10.1007/978-3-540-74456-6_14
URL : https://hal.archives-ouvertes.fr/hal-00335723

S. Crespi-reghizzi and D. Mandrioli, Operator precedence and the visibly pushdown property, Language and Automata Theory and Applications, 2010.
DOI : 10.1016/j.jcss.2011.12.006

P. W. Dymond, Input-driven languages are in log n depth, Information Processing Letters, vol.26, issue.5, pp.247-250, 1988.
DOI : 10.1016/0020-0190(88)90148-2

M. R. Garey and D. S. Johnson, Computers and Intractability, A Guide to the Theory of NP-Completeness, Freeman, 1979.

S. Ginsburg, Algebraic and Automata-Theoretic Properties of Formal Languages, 1975.

S. Ginsburg, S. A. Greibach, and M. A. Harrison, One-way stack automata, Journal of the ACM, vol.14, issue.2, pp.389-418, 1967.
DOI : 10.1145/321386.321403

Y. S. Han and K. Salomaa, Nondeterministic state complexity of nested word automata, Theoretical Computer Science, vol.410, issue.30-32, pp.2961-2971, 2009.
DOI : 10.1016/j.tcs.2009.01.004

H. Hunt, On the complexity of finite, pushdown, and stack automata, Mathematical Systems Theory, vol.13, issue.1, pp.33-52, 1976.
DOI : 10.1016/S0022-0000(69)80015-2

M. Kutrib and A. Malcher, Reversible pushdown automata In: Language and Automata Theory and Applications, LNCS, vol.6031, pp.368-379, 2010.
DOI : 10.1007/978-3-642-13089-2_31

K. J. Lange, A note on the P-completeness of deterministic one-way stack languages, J. Univ. Comput. Sci, vol.16, pp.795-799, 2010.

M. Li and P. Vitányi, An Introduction to Kolmogorov Complexity and its Applications, 1993.
DOI : 10.1007/978-1-4757-2606-0

K. Mehlhorn, Pebbling mountain ranges and its application of DCFL-recongnition, International Colloquium on Automata, Languages and Programming, pp.422-435, 1980.

A. Okhotin and K. Salomaa, State complexity of operations on input-driven pushdown automata, In: Mathematical Foundations of Computer Science, 2011.

X. Piao and K. Salomaa, Operational state complexity of nested word automata, Theoretical Computer Science, vol.410, issue.35, pp.3290-3302, 2009.
DOI : 10.1016/j.tcs.2009.05.002
URL : http://doi.org/10.1016/j.tcs.2009.05.002

A. Salomaa, Formal Languages, ACM Monograph Series, 1973.

E. Shamir and C. Beeri, Checking stacks and context-free programmed grammars accept p-complete languages, International Colloquium of Automata, Languages, and Programming (ICALP 1974). LNCS, pp.27-33, 1974.
DOI : 10.1007/3-540-06841-4_50

I. H. Sudborough, On the Tape Complexity of Deterministic Context-Free Languages, Journal of the ACM, vol.25, issue.3, pp.405-414, 1978.
DOI : 10.1145/322077.322083