B. , S. Bellantoni, and S. Cook, A new recursion-theoretic characterization of the poly-time functions, Let us see first how these actions modify the encoding of configurations. So, we References [, pp.97-110, 1992.

J. L. Balcázar, J. Díaz, and J. Gabarró, Structural complexity II, EATCS Monographs of Theoretical Computer Science, vol.22, 1990.
DOI : 10.1007/978-3-642-75357-2

S. Bellantoni, Characterizing parallel time by type 2 recursions with polynomial output length, Logic and Computational Complexity, pp.253-268, 1995.
DOI : 10.1007/3-540-60178-3_88

G. Bonfante, R. Kahle, J. Marion, and I. Oitavem, Recursion Schemata for NCk, CSL '08, 2008.
URL : https://hal.archives-ouvertes.fr/hal-00342366

A. K. Chandra, D. J. Ko?en, and L. J. Stockmeyer, Alternation, Journal of the ACM, vol.28, issue.1, pp.114-133, 1981.
DOI : 10.1145/322234.322243

P. Clote, Sequential, machine-independent characterizations of the parallel complexity classes AlogTIME, AC k , NC k and NC, Feasible Mathematics, pp.49-69, 1990.
DOI : 10.1007/978-1-4612-3466-1_4

A. Cobham, The intrinsic computational difficulty of functions, Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pp.24-30, 1962.

J. Edmonds, Paths, trees, and flowers, Journal canadien de math??matiques, vol.17, issue.0, pp.449-467, 1965.
DOI : 10.4153/CJM-1965-045-4

O. Goldreich, Computational Complexity: A Conceptual Perspective, 2008.

[. Immerman, Descriptive Complexity [Lei91] D. Leivant. A foundational delineation of computational feasiblity, Proceedings of the Sixth IEEE Symposium on Logic in Computer Science (LICS'91), 1991.

D. Leivant, Stratified functional programs and computational complexity, Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '93, 1993.
DOI : 10.1145/158511.158659

]. D. Lei98 and . Leivant, A characterization of NC by tree recurrence, Foundations of Computer Science, pp.716-724, 1998.

D. Leivant and J. Marion, A characterization of alternating log time by ramified recurrence, Theoretical Computer Science, vol.236, issue.1-2, pp.192-208, 2000.
DOI : 10.1016/S0304-3975(99)00209-1
URL : https://hal.archives-ouvertes.fr/inria-00099078

J. Marion, On tiered small jump operators, Logical Methods in Computer Science, vol.5, issue.1, 2009.
DOI : 10.2168/LMCS-5(1:7)2009
URL : https://hal.archives-ouvertes.fr/hal-00439624

V. Mogbil and V. Rahli, Uniform Circuits, & Boolean Proof Nets, In Lecture Notes in Computer Science, vol.4514, pp.401-421, 2007.
DOI : 10.1007/978-3-540-72734-7_28
URL : https://hal.archives-ouvertes.fr/hal-00122980

]. W. Ruz81 and . Ruzzo, On uniform circuit complexity, Journal of Computer and System Sciences, vol.22, pp.365-383, 1981.

J. Sakarovitch, Elements of Automata Theory, 2009.
DOI : 10.1017/CBO9781139195218

]. H. Sim88 and . Simmons, The realm of primitive recursion, Archive for Mathematical Logic, vol.27, pp.177-188, 1988.