Abstract
A non-empty word w of a, b * is a Lyndon word if and only if it is strictly smaller for the lexicographical order than any of its proper suffixes. Such a word w is either a letter or admits a standard factorization uv where v is its smallest proper suffix. For any Lyndon word v, we show that the set of Lyndon words having v as right factor of the standard factorization is rational and compute explicitly the associated generating function. Next we establish that, for the uniform distribution over the Lyndon words of length n, the average length of the right factor v of the standard factorization is asymptotically equivalent to 3n/4. Finally we present algorithms on Lyndon words derived from our work together with experimental results.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
J. Berstel and L. Boasson. The set of lyndon words is not context-free. Bull. Eur. Assoc. Theor. Comput. Sci. EATCS, 63:139–140, 1997.
J. Berstel and D. Perrin. Theory of codes. Academic Press, 1985.
J. Berstel and M. Pocchiola. Average cost of Duval’s algorithm for generating Lyndon words. Theoret. Comput. Sci., 132(1–2):415–425, 1994.
K. S. Booth. Lexicographically least circular substrings. Inform. Process. Lett., 10(4–5):240–242, 1980.
K.T. Chen, R.H. Fox, and R.C. Lyndon. Free differential calculus IV: The quotient groups of the lower central series. Ann. Math., 58:81–95, 1958.
J.-P. Duval. Factorizing words over an ordered alphabet. Journal of Algorithms, 4:363–381, 1983.
J.-P. Duval. Génération d’une section des classes de conjugaison et arbre des mots de Lyndon de longueur bornée. Theoret. Comput. Sci., 4:363–381, 1988.
P. Flajolet, X. Gourdon, and D. Panario. The complete analysis of a polynomial factorization algorithm over finite fields. Journal of Algorithms, 40:37–81, 2001.
P. Flajolet and R. Sedgewick. Analytic combinatorics-symbolic combinatorics. Book in preparation, 2002. (Individual chapters are available as INRIA Research reports at http://www.algo.inria.fr/.ajolet/publist.html).
S. Golomb. Irreducible polynomials, synchronizing codes, primitive necklaces and cyclotomic algebra. In Proc. Conf Combinatorial Math. and Its Appl., pages 358–370, Chapel Hill, 1969. Univ. of North Carolina Press.
D. E. Knuth. The average time for carry propagation. Indagationes Mathematicae, 40:238–242, 1978.
M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of mathematics and its applications. Addison-Wesley, 1983.
M. Lothaire. Applied Combinatorics on Words. Cambridge University Press, 2003. in preparation, chapters available at http://www-igm.univ-mlv.fr/~berstel/Lothaire.
R. C. Lyndon. On Burnside problem I. Trans. American Math. Soc., 77:202–215, 1954.
D. Panario and B. Richmond. Smallest components in decomposable structures: exp-log class. Algorithmica, 29:205–226, 2001.
C. Reutenauer. Free Lie algebras. Oxford University Press, 1993.
F. Ruskey and J. Sawada. Generating Lyndon brackets: a basis for the th homogeneous component of the free Lie algebra. Journal of Algorithms, (to appear). Available at http://www.cs.uvic.ca/ fruskey/Publications/.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2003 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bassino, F., Clément, J., Nicaud, C. (2003). The Average Lengths of the Factors of the Standard Factorization of Lyndon Words. In: Ito, M., Toyama, M. (eds) Developments in Language Theory. DLT 2002. Lecture Notes in Computer Science, vol 2450. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45005-X_27
Download citation
DOI: https://doi.org/10.1007/3-540-45005-X_27
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-40431-6
Online ISBN: 978-3-540-45005-4
eBook Packages: Springer Book Archive