R. Alur and P. Madhusudan, Visibly pushdown languages, ACM Symposium on Theory of Computing (STOC, pp.202-211, 2004.

R. Alur and P. Madhusudan, Adding nesting structure to words, Journal of the ACM, vol.56, p.3, 2009.

B. Braunmühl and R. Verbeek, Input driven languages are recognized in log n space, Annals of Discrete Mathematics, vol.24, pp.1-20, 1985.

M. Domaratzki, State complexity of proportional removals, Journal of Automata, Languages and Combinatorics, vol.7, issue.4, pp.455-468, 2002.

J. Esparza, P. Ganty, S. Kiefer, and M. Luttenberger, Parikh's theorem: A simple and direct automaton construction, Information Processing Letters, vol.111, pp.614-619, 2011.

D. Go?, A. Palioudakis, and K. Salomaa, Nondeterministic state complexity of proportional removals, International Journal of Foundations of Computer Science, vol.25, issue.7, pp.823-836, 2014.

L. H. Haines, On free monoids partially ordered by embedding, Journal of Combinatorial Theory, vol.6, pp.94-98, 1969.

Y. Han, S. Ko, T. Ng, and K. Salomaa, State complexity of insertion, International Journal of Foundations of Computer Science, vol.27, issue.7, pp.863-878, 2016.

Y. Han, S. Ko, and K. Salomaa, State complexity of deletion and bipolar deletion, Acta Informatica, vol.53, pp.67-85, 2016.

Y. Han and K. Salomaa, Nondeterministic state complexity of nested word automata, Theoretical Computer Science, vol.410, pp.2961-2971, 2009.

G. Higman, Ordering by divisibility in abstract algebras, pp.326-336, 1952.

H. Gruber, M. Holzer, and M. Kutrib, More on the size of Higman-Haines sets: effective constructions, Fundamenta Informaticae, vol.91, pp.105-121, 2009.

P. Karandikar, M. Niewerth, . Ph, and . Schnoebelen, On the state complexity of closures and interiors of regular languages with subwords and superwords, Theoretical Computer Science, vol.610, pp.91-107, 2016.

J. Van-leeuven, Effective construction in well-partially-ordered free monoids, Discrete Mathematics, vol.21, issue.3, pp.237-252, 1978.

A. N. Maslov, Estimates of the number of states of finite automata, Soviet Mathematics Doklady, vol.11, pp.1373-1375, 1970.

K. Mehlhorn, Pebbling mountain ranges and its application to DCFLrecognition, Automata, Languages and Programming (ICALP 1980, vol.85, pp.422-435, 1980.
DOI : 10.1007/3-540-10003-2_89

A. Okhotin, On the state complexity of scattered substrings and superstrings, Fundamenta Informaticae, vol.99, issue.3, pp.325-338, 2010.

A. Okhotin, Input-driven languages are linear conjunctive, Theoretical Computer Science, vol.618, pp.52-71, 2016.
DOI : 10.1016/j.tcs.2016.01.007

A. Okhotin, K. Salomaa, and ;. News, Complexity of input-driven pushdown automata, vol.45, pp.47-67, 2014.
DOI : 10.1145/2636805.2636821

A. Okhotin and K. Salomaa, Descriptional complexity of unambiguous input-driven pushdown automata, Theoretical Computer Science, vol.566, pp.1-11, 2015.
DOI : 10.1016/j.tcs.2014.11.015

A. Okhotin and K. Salomaa, State complexity of operations on input-driven pushdown automata, Journal of Computer and System Sciences, vol.86, pp.207-228, 2017.
DOI : 10.1016/j.jcss.2017.02.001

A. Okhotin and K. Salomaa, Edit distance neighbourhoods of input-driven pushdown automata, Computer Science in Russia, vol.10304, pp.260-272, 2017.
DOI : 10.1007/978-3-319-58747-9_23

A. Okhotin and K. Salomaa, The quotient operation on input-driven pushdown automata, Descriptional Complexity of Formal Systems (DCFS 2017, vol.10316, pp.299-310, 2017.
DOI : 10.1007/978-3-319-60252-3_24
URL : https://hal.archives-ouvertes.fr/hal-01657008

X. Piao and K. Salomaa, Operational state complexity of nested word automata, Theoretical Computer Science, vol.410, pp.3290-3302, 2009.

K. Salomaa, Limitations of lower bound methods for deterministic nested word automata, vol.209, pp.580-589, 2011.
DOI : 10.1016/j.ic.2010.11.021
URL : https://doi.org/10.1016/j.ic.2010.11.021

J. I. Seiferas and R. Mcnaughton, Regularity-preserving relations, Theoretical Computer Science, vol.2, pp.147-154, 1976.
DOI : 10.1016/0304-3975(76)90030-x
URL : https://doi.org/10.1016/0304-3975(76)90030-x