G. Cheon and L. W. Shapiro, Protected points in ordered trees, Applied Mathematics Letters, vol.21, issue.5, pp.516-520, 2008.
DOI : 10.1016/j.aml.2007.07.001
URL : http://doi.org/10.1016/j.aml.2007.07.001

R. R. Du and H. Prodinger, Notes on protected nodes in digital search trees, Applied Mathematics Letters, vol.25, issue.6
DOI : 10.1016/j.aml.2011.11.017

P. Flajolet and R. Sedgewick, Mellin transforms and asymptotics: Finite differences and Rice's integrals, Theoretical Computer Science, vol.144, issue.1-2, pp.101-124, 1995.
DOI : 10.1016/0304-3975(94)00281-M
URL : http://doi.org/10.1016/0304-3975(94)00281-m

P. Flajolet and R. Sedgewick, The average case analysis of algorithms: Mellin transform asymptotics, Research Report, vol.2956, 1996.
URL : https://hal.archives-ouvertes.fr/inria-00073742

P. Flajolet, X. Gourdon, and P. Dumas, Mellin transforms and asymptotics: Harmonic sums, Theoretical Computer Science, vol.144, issue.1-2, pp.3-58, 1995.
DOI : 10.1016/0304-3975(95)00002-E
URL : https://hal.archives-ouvertes.fr/inria-00074307

P. Flajolet, M. Roux, and B. Vallée, Digital trees and memoryless sources: from arithmetics to analysis, 21st International Meeting on Probabilistic, Combinatorial, and Asymptotic Methods in the Analysis of Algorithms (AofA '10), volume AM of DMTCS Proceedings, pp.233-260, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01083405

L. Guibas and A. M. Odlyzko, Maximal Prefix-Synchronized Codes, SIAM Journal on Applied Mathematics, vol.35, issue.2, pp.401-418, 1978.
DOI : 10.1137/0135034

L. Guibas and A. M. Odlyzko, Periods in strings, Journal of Combinatorial Theory, Series A, vol.30, issue.1, pp.19-43, 1981.
DOI : 10.1016/0097-3165(81)90038-8
URL : http://doi.org/10.1016/0097-3165(81)90038-8

L. Guibas and A. M. Odlyzko, String overlaps, pattern matching, and nontransitive games, Journal of Combinatorial Theory, Series A, vol.30, issue.2, pp.183-208, 1981.
DOI : 10.1016/0097-3165(81)90005-4
URL : http://doi.org/10.1016/0097-3165(81)90005-4

P. Jacquet and W. Szpankowski, Autocorrelation on words and its applications, Journal of Combinatorial Theory, Series A, vol.66, issue.2, pp.237-269, 1994.
DOI : 10.1016/0097-3165(94)90065-5
URL : https://hal.archives-ouvertes.fr/inria-00075453

P. Jacquet and W. Szpankowski, Analytic approach to pattern matching, Applied Combinatorics on Words, chapter 7. Cambridge, 2005. See Lothaire, 2005.

H. M. Mahmoud and M. D. Ward, Asymptotic distribution of two-protected nodes in random binary search trees, Applied Mathematics Letters, vol.25, issue.12
DOI : 10.1016/j.aml.2012.06.005

T. Mansour, Protected points in k-ary trees, Applied Mathematics Letters, vol.24, issue.4, pp.478-480, 2011.
DOI : 10.1016/j.aml.2010.10.045
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.602.1230

M. Régnier and A. Denise, Rare events and conditional events on random strings, Discrete Mathematics and Theoretical Computer Science, vol.6, pp.191-214, 2004.

W. Szpankowski, Average Case Analysis of Algorithms on Sequences, 2001.
DOI : 10.1002/9781118032770