E. A. Bender, Convex ? -ominoes. Discrete Math, pp.219-226, 1974.

M. Delest, Langages algébriques: ` a lafrontì ere entre la Combinatoire et l'Informatique, 1994.

M. Delest and J. M. Fédou, Attribute grammars are useful for combinatorics, Theoretical Computer Science, vol.98, issue.1, pp.65-76, 1992.
DOI : 10.1016/0304-3975(92)90380-X

M. Delest, J. M. Fédou, G. Melançon, and N. Rouillon, Computation and images in combinatorics, 1998.
DOI : 10.1007/978-3-7091-6461-7_10

M. Delest and X. G. Viennot, Algebraic languages and polyominoes enumeration, Theoretical Computer Science, vol.34, issue.1-2, pp.169-206, 1984.
DOI : 10.1016/0304-3975(84)90116-6

I. Dutour, Grammaires d'objets: ´ enumération, bijections et génération aléatoire, 1996.

I. Dutour and J. M. Fédou, Object grammars and bijections. LaBRI, pp.1164-97, 1997.
URL : https://hal.archives-ouvertes.fr/hal-00307507

P. Flajolet, P. Zimmermann, and B. Van-cutsem, A calculus for the random generation of labelled combinatorial structures, Theoretical Computer Science, vol.132, issue.1-2, pp.1-35, 1994.
DOI : 10.1016/0304-3975(94)90226-7

URL : https://hal.archives-ouvertes.fr/hal-00917729

D. H. Greene, Labelled formal languages and their uses, 1983.

T. Hickey and J. Cohen, Uniform Random Generation of Strings in a Context-Free Language, SIAM Journal on Computing, vol.12, issue.4, pp.645-655, 1983.
DOI : 10.1137/0212044

A. Nijenhuis and H. S. Wilf, Combinatorial Algorithms, 1975.

N. Rouillon, Calcul et Image en Combinatoire, 1994.

X. G. Viennot, Enumerative combinatorics and algebraic languages, Proceedings FCT'85, pp.450-464, 1985.
DOI : 10.1007/BFb0028829

H. S. Wilf, A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects, Advances in Mathematics, vol.24, issue.2, pp.281-291, 1977.
DOI : 10.1016/S0001-8708(77)80046-7

H. S. Wilf, A Unified Setting for Selection Algorithms (II), Ann. Discrete Math, vol.2, pp.135-148, 1978.
DOI : 10.1016/S0167-5060(08)70327-3