Lyndon words with a fixed standard right factor, Proceedings of the fifteenth annual ACM-SIAM Symposium on Discrete Algorithms, pp.646-647, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00619866
The Average Lengths of the Factors of the Standard Factorization of Lyndon Words, DLT'02, pp.307-318, 2003. ,
DOI : 10.1007/3-540-45005-X_27
URL : https://hal.archives-ouvertes.fr/hal-00619865
The set of lyndon words is not context-free, Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, vol.63, pp.139-140, 1997. ,
URL : https://hal.archives-ouvertes.fr/hal-00619462
Theory of codes, 1985. ,
URL : https://hal.archives-ouvertes.fr/hal-00619780
Average cost of Duval's algorithm for generating Lyndon words, Theoretical Computer Science, vol.132, issue.1-2, pp.1-2, 1994. ,
DOI : 10.1016/0304-3975(94)00013-1
Théorié elémentaire des fonctions analytiques d'une ou plusieurs variables complexes, 1985. ,
Free differential calculus IV: The quotient groups of the lower central series, Ann. Math, vol.58, pp.81-95, 1958. ,
Asymptotic Method in Analysis, 1961. ,
Factorizing words over an ordered alphabet, Journal of Algorithms, vol.4, issue.4, pp.363-381, 1983. ,
DOI : 10.1016/0196-6774(83)90017-2
An introduction to Probability Theory and Its Applications, 1968. ,
The Complete Analysis of a Polynomial Factorization Algorithm over Finite Fields, Journal of Algorithms, vol.40, issue.1, pp.37-81, 2001. ,
DOI : 10.1006/jagm.2001.1158
URL : https://hal.archives-ouvertes.fr/inria-00073319
Analytic combinatorics?symbolic combinatorics, Book in preparation, (Individual chapters are available as INRIA Research reports at http, 2002. ,
The Cycle Construction, SIAM Journal on Discrete Mathematics, vol.4, issue.1, pp.58-60, 1991. ,
DOI : 10.1137/0404006
Necklaces of beads in k colors and k-ary de Bruijn sequences, Discrete Math, pp.207-210, 1978. ,
Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra, Proc. Conf Combinatorial Math. and Its Appl, pp.358-370, 1969. ,
An introduction to the theory of numbers, Bulletin of the American Mathematical Society, vol.35, issue.6, 1938. ,
DOI : 10.1090/S0002-9904-1929-04793-1
The average time for carry propagation, Indagationes Mathematicae, vol.40, pp.238-242, 1978. ,
of Encyclopedia of mathematics and its applications, Combinatorics on Words, vol.17, 1983. ,
On Burnside problem I, Trans, American Math. Soc, vol.77, pp.202-215, 1954. ,
Limit law of the length of the standard right factor of a Lyndon word, arXiv:math ,
Handbook of Combinatorics, 1995. ,
Smallest components in decomposable structures: Exp-log class, Algorithmica, vol.14, issue.2, pp.205-226, 2001. ,
DOI : 10.1007/BF02679619
Free lie algebras, 1993. ,
DOI : 10.1016/S1570-7954(03)80075-X
Generating Lyndon brackets: a basis for the n-th homogeneous component of the free Lie algebra, Journal of Algorithms, vol.46, pp.21-26, 2003. ,