R. Alur and P. Madhusudan, Adding nesting structure to words, J. ACM, vol.56, issue.3, p.43, 2009.

N. Chomsky and M. Schützenberger, The algebraic theory of context-free languages, Stud. Logic Found. Math, vol.35, pp.118-161, 1963.

M. Chrobak, Finite automata and unary languages, Theoret. Comput. Sci, vol.47, issue.3, pp.90142-90150, 1986.

S. Ginsburg and H. G. Rice, Two families of languages related to ALGOL, J. ACM, vol.9, issue.3, pp.350-371, 1962.

B. Guillon, G. Pighizzini, L. Prigioniero, and D. Pr??a, Two-way automata and onetape machines -Read only versus linear time, DLT 2018, vol.11088, pp.366-378, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02079083

B. Guillon and L. Prigioniero, Linear-time limited automata, Theoret. Comput. Sci, 2019.
URL : https://hal.archives-ouvertes.fr/hal-01905632

L. A. Hemaspaandra, P. Mukherji, and T. Tantau, Context-free languages can be accepted with absolutely no space overhead, Inform. and Comput, vol.203, issue.2, pp.163-180, 2005.

F. C. Hennie, One-tape, off-line Turing machine computations, Information and Control, vol.8, issue.6, pp.553-578, 1965.

T. N. Hibbard, A generalization of context-free determinism, Information and Control, vol.11, issue.1/2, pp.196-238, 1967.

P. Jan?ar, F. Mráz, and M. Plátek, Characterization of context-free languages by erasing automata, MFCS 1992, vol.629, pp.307-314, 1992.

P. Jan?ar, F. Mráz, and M. Plátek, A taxonomy of forgetting automata, MFCS 1993, vol.711, pp.527-536, 1993.

P. Jan?ar, F. Mráz, and M. Plátek, Forgetting automata and context-free languages, Acta Inform, vol.33, issue.5, pp.409-420, 1996.

P. Jan?ar, F. Mráz, M. Plátek, and J. Vogel, Restarting automata, FCT 1995, vol.965, pp.283-292, 1995.

M. Kutrib, G. Pighizzini, and M. Wendlandt, Descriptional complexity of limited automata, Inform. and. Comput, vol.259, issue.2, pp.259-276, 2018.

M. Kutrib and M. Wendlandt, On simulation cost of unary limited automata, DCFS 2015, vol.9118, pp.153-164, 2015.

M. Kutrib and M. Wendlandt, Reversible limited automata, Fund. Inform, vol.155, issue.1-2, pp.31-58, 2017.

K. Mehlhorn, Pebbling moutain ranges and its application of DCFL-recognition, ICALP 1980, vol.85, pp.422-435, 1980.

I. R. Nasyrov, Deterministic realization of nondeterministic computations with a low measure of nondeterminism, Cybernetics, vol.27, issue.2, pp.170-179, 1991.

W. F. Ogden, R. J. Ross, and K. Winklmann, An "interchange lemma" for contextfree languages, SIAM J. Comput, vol.14, issue.2, pp.410-415, 1985.

A. Okhotin, Non-erasing variants of the Chomsky-Schützenberger theorem, DLT 2012, vol.7410, pp.121-129, 2012.

F. Otto, Restarting automata and their relations to the Chomsky hierarchy, DLT 2003, vol.2710, pp.55-74, 2003.

J. Peckel, On a deterministic subclass of context-free languages, MFCS 1977, vol.53, pp.430-434, 1977.

J. Peckel, A deterministic subclass of context-free languages, ?asopis pro p?stování matematiky, vol.103, issue.1, pp.43-52, 1978.

G. Pighizzini, Nondeterministic one-tape off-line Turing machines, J. Autom. Lang. Comb, vol.14, issue.1, pp.107-124, 2009.

G. Pighizzini, Two-way finite automata: Old and recent results, Fund. Inform, vol.126, issue.2-3, pp.225-246, 2013.

G. Pighizzini, Guest column: One-tape Turing machine variants and language recognition, SIGACT News, vol.46, issue.3, pp.37-55, 2015.

G. Pighizzini, Strongly limited automata, Fund. Inform, vol.148, issue.3-4, pp.369-392, 2016.

G. Pighizzini and A. Pisoni, Limited automata and regular languages. Internat, J. Found. Comput. Sci, vol.25, issue.7, pp.897-916, 2014.

G. Pighizzini and A. Pisoni, Limited automata and context-free languages, Fund. Inform, vol.136, issue.1-2, pp.157-176, 2015.

G. Pighizzini and L. Prigioniero, Limited automata and unary languages, Inform. and Comput, vol.266, pp.60-74, 2019.

W. J. Sakoda, M. Sipser, R. J. Lipton, W. A. Burkhard, W. J. Savitch et al., Nondeterminism and the size of two way finite automata

, Proc. 10th Annual ACM Symposium on Theory of Computing (STOC 1978), pp.275-286, 1978.

J. C. Shepherdson, The reduction of two-way automata to one-way automata, IBM J. Res. Dev, vol.3, issue.2, pp.198-200, 1959.

N. J. Sloane, The On-Line Encyclopedia of Integer Sequences

K. W. Wagner and G. Wechsung, , 1986.

G. Wechsung, Characterization of some classes of context-free languages in terms of complexity classes, MFCS 1975, vol.32, pp.457-461

, , 1975.

G. Wechsung and A. Brandstädt, A relation between space, return and dual return complexities, Theoret. Comput. Sci, vol.9, issue.79, pp.90010-90010, 1979.

T. Yamakami, B. Catania, R. Královi?, and J. R. Nawrocki, Behavioral strengths and weaknesses of various models of limited automata, SOFSEM 2019, vol.11376, pp.519-530, 2019.