A. Bacher, A. Bernini, L. Ferrari, B. Gunby, R. Pinzani et al., The Dyck pattern poset. Discrete Math, pp.12-23, 2014.
URL : https://hal.archives-ouvertes.fr/hal-00989619

E. Barcucci, A. Bernini, S. Bilotta, and R. Pinzani, Non-overlapping matrices, Theoretical Computer Science, vol.658, pp.36-45, 2017.
DOI : 10.1016/j.tcs.2016.05.009

A. Bernini, S. Bilotta, R. Pinzani, A. Sabri, and V. Vajnovszki, Prefix partitioned gray codes for particular cross-bifix-free sets, Cryptography and Communications, vol.2731, issue.632, pp.359-369, 2014.
DOI : 10.1007/3-540-45066-1_5

A. Bernini, S. Bilotta, R. Pinzani, and V. Vajnovszki, A Gray code for cross-bifix-free sets, Mathematical Structures in Computer Science, vol.43, issue.02, pp.184-196, 2017.
DOI : 10.1007/3-540-57568-5_250
URL : https://hal.archives-ouvertes.fr/hal-01071362

A. Bernini, L. Ferrari, and E. Steíngrimsson, The Möbius function of the consecutive pattern poset, Electron. J. Combin, vol.18, issue.1, p.146, 2011.

A. Bernini, L. Ferrari, R. Pinzani, and J. West, Pattern-avoiding Dyck paths, Discrete Math. Theoret. Comput. AS, pp.683-694, 2013.
URL : https://hal.archives-ouvertes.fr/hal-01229675

Y. M. Chee, H. M. Kiah, P. Purkayastha, and C. Wang, Cross-Bifix-Free Codes Within a Constant Factor of Optimality, IEEE Transactions on Information Theory, vol.59, issue.7, pp.4668-4674, 2013.
DOI : 10.1109/TIT.2013.2252952

M. Dairyko, L. Pudwell, S. Tyner, and C. Wynn, Non-contiguous pattern avoidance in binary trees, Electron. J. Combin, vol.19, issue.3, p.22, 2012.

S. Elizalde, Generating Trees for Permutations Avoiding Generalized Patterns, Annals of Combinatorics, vol.11, issue.3-4, pp.435-458, 2007.
DOI : 10.1007/s00026-007-0328-8

S. Elizalde and M. Noy, Consecutive patterns in permutations, Advances in Applied Mathematics, vol.30, issue.1-2, pp.110-125, 2003.
DOI : 10.1016/S0196-8858(02)00527-4
URL : https://hal.archives-ouvertes.fr/hal-01283156

E. Rowland, Pattern avoidance in binary trees, Journal of Combinatorial Theory, Series A, vol.117, issue.6, pp.741-758, 2010.
DOI : 10.1016/j.jcta.2010.03.004

B. E. Sagan, Pattern avoidance in set partitions, Ars Combin, vol.94, pp.79-96, 2010.

V. Vajnovszki, A Loopless Generation of Bitstrings without p Consecutive Ones, Discrete Math. Theor. Comput. Sci. -Springer, vol.227, p.240, 2001.
DOI : 10.1007/978-1-4471-0717-0_19

J. West, Generating trees and the Catalan and Schröder numbers. Discrete Math, pp.247-262, 1995.

J. West, Generating trees and forbidden subsequences. Discrete Math, pp.363-374, 1996.