M. Alberts, Space complexity of alternating Turing machines, vol.199, pp.1-7, 1985.

Z. Bednárová, V. Geffert, C. Mereghetti, and B. Palano, Removing nondeterminism in constant height pushdown automata, Inf. Comput, vol.237, pp.257-267, 2014.

Z. Bednárová, V. Geffert, K. Reinhardt, and A. Yakaryilmaz, New results on the minimum amount of useful space, Int. J. Found. Comput. Sci, vol.27, issue.2, pp.259-282, 2016.

N. Chomsky, A note on phrase structure grammars, Information and Control, vol.2, issue.4, pp.80017-80023, 1959.

V. Geffert, C. Mereghetti, and B. Palano, More concise representation of regular languages by automata and regular expressions, Inf. Comput, vol.208, issue.4, pp.385-394, 2010.

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, and L. Prigioniero, Non-self-embedding grammars, constant-height pushdown automata, and limited automata, Proceedings. Lecture Notes in Computer Science, vol.10977, pp.186-197, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02079141

J. Hartmanis, Context-free languages and Turing machine computations, Mathematical Aspects of Computer Science. Proceedings of Symposia in Applied Mathematics, vol.19, pp.42-51, 1967.

J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation, 1979.

A. Malcher, K. Meckel, C. Mereghetti, and B. Palano, Descriptional complexity of pushdown store languages, Journal of Automata, Languages and Combinatorics, vol.17, issue.2-4, pp.225-244, 2012.

C. Mereghetti and G. Pighizzini, Optimal simulations between unary automata, SIAM J. Comput, vol.30, issue.6, pp.1976-1992, 2001.

,

A. R. Meyer and M. J. Fischer, Economy of description by automata, grammars, and formal systems, 12th Annual Symposium on Switching and Automata Theory, pp.188-191, 1971.

G. Pighizzini, J. Shallit, and M. Wang, Unary context-free grammars and pushdown automata, descriptional complexity and auxiliary space lower bounds, J. Comput. Syst. Sci, vol.65, issue.2, pp.393-414, 2002.

T. Rado, On non-computable functions, Bell System Technical Journal, vol.41, issue.3, pp.877-884, 1962.