M. Bousquet-mélou, A. Denise, P. Flajolet, D. Gardy, and D. Gouyou-beauchamps, Generating functions of generating trees, Discrete Mathematics, vol.246, pp.29-55, 2002.

C. Banderier and P. Flajolet, Basic analytic combinatorics of directed lattice paths, Theoretical Computer Science, vol.281, issue.1-2, pp.37-80, 2002.
DOI : 10.1016/S0304-3975(02)00007-5

K. [. Bandlow and . Killpatrick, An Area-to-Inv Bijection Between Dyck Paths and 312- avoiding Permutations. The Electronic Jornal of Combinatorics, 2001.

A. [. Barcucci, E. Del-lungo, R. Pergola, and . Pinzani, ECO:a methodology for the enumeration of combinatorial objects, Journal of Difference Equations and Applications, vol.132, issue.3, pp.435-490, 1999.
DOI : 10.1016/0012-365X(94)00067-1

C. Banderier and D. Merlini, Lattice paths with an infinite set of jumps, Proceedings of the 14-th International Conference on Formal Power Series and Algebraic Combinatorics, 2002.
URL : https://hal.archives-ouvertes.fr/hal-00082480

R. [. Chung, V. E. Graham, M. Hoggat, and . Kleiman, The number of baxter permutations, Journal of Combinatorial Theory, Series A, vol.24, issue.3, pp.382-394, 1978.
DOI : 10.1016/0097-3165(78)90068-7

J. [. Delest and . Fédou, Enumeration of skew Ferrers diagrams, Discrete Mathematics, vol.112, issue.1-3, pp.65-79, 1993.
DOI : 10.1016/0012-365X(93)90224-H

D. [. Goulden and . Jackson, Combinatorial Enumeration, E. Knuth. The art of computer programming, vol.13, 1973.

]. D. Mer02 and . Merlini, The internal path length of proper generating trees, 2002.

D. Merlini, D. G. Rogers, R. Sprugnoli, and M. C. Verri, On some alternative characterizations of Riordan arrays, Journal canadien de math??matiques, vol.49, issue.2, pp.301-320, 1997.
DOI : 10.4153/CJM-1997-015-x

D. Merlini, D. G. Rogers, R. Sprugnoli, and M. C. Verri, Underdiagonal lattice paths with unrestricted steps, Discrete Applied Mathematics, vol.91, issue.1-3, pp.197-213, 1999.
DOI : 10.1016/S0166-218X(98)00126-7

D. Merlini, R. Sprugnoli, and M. C. Verri, Algebraic and combinatorial properties of simple, coloured walks, Proceedings of CAAP'94, pp.218-233, 1994.
DOI : 10.1007/BFb0017484

R. [. Merlini, M. C. Sprugnoli, and . Verri, The area determined by underdiagonal lattice paths, Proceedings of CAAP'96, pp.59-71, 1996.
DOI : 10.1007/3-540-61064-2_29

M. [. Merlini and . Verri, Generating trees and proper Riordan Arrays, Discrete Mathematics, vol.218, issue.1-3, pp.167-183, 2000.
DOI : 10.1016/S0012-365X(99)00343-X

]. D. Rog78 and . Rogers, Pascal triangles, Catalan numbers and renewal arrays, Discrete Mathematics, vol.22, pp.301-310, 1978.

S. [. Shapiro, W. Getu, L. Woan, and . Woodson, The Riordan group, Discrete Applied Mathematics, vol.34, issue.1-3, pp.229-239, 1991.
DOI : 10.1016/0166-218X(91)90088-E

]. R. Spr94 and . Sprugnoli, Riordan arrays and combinatorial sums, Discrete Mathematics, vol.132, pp.267-290, 1994.

]. R. Sul98 and . Sulanke, Bijective recurrences concerning Schröder paths, Electronic Journal of Combinatorics, vol.5, issue.1, 1998.

]. B. Sul00 and . Sulanke, Moments of generalized Motzkin paths Generating trees and the Catalan and Schröder numbers, Journal of Integer Sequences J. West. Discrete Mathematics, vol.3, issue.146, pp.247-262, 1995.

]. J. Wes96 and . West, Generating trees and forbidden subsequences, Discrete Mathematics, vol.157, pp.363-374, 1996.