Advertisement

Transfinite Lyndon Words

  • Luc Boasson
  • Olivier CartonEmail author
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 9168)

Abstract

In this paper, we extend the notion of Lyndon word to transfinite words. We prove two main results. We first show that, given a transfinite word, there exists a unique factorization in Lyndon words that are locally decreasing, a relaxation of the condition used in the case of finite words.

In a second part, we prove that the factorization of a rational word has a special form and that it can be computed in polynomial time from a rational expression describing the word.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Büchi, J.R.: Transfinite automata recursions and weak second order theory of ordinals. In: Proc. Int. Congress Logic, Methodology, and Philosophy of Science, Jerusalem 1964, North Holland, pp. 2–23 (1965)Google Scholar
  2. 2.
    Carton, O., Choffrut, C.: Periodicity and roots of transfinite strings. Theoret. Informatics and Applications 35(6), 525–533 (2001)MathSciNetCrossRefGoogle Scholar
  3. 3.
    Duval, J.P.: Mots de Lyndon et périodicité. RAIRO Informat. Théor. 14, 181–191 (1980)MathSciNetGoogle Scholar
  4. 4.
    Knuth, D.E.: Combinatorial Algorithms, The Art of Computer Programming. Addison-Wesley Professional, vol. 4A (2011)Google Scholar
  5. 5.
    Lothaire, M.: Combinatorics on Words, Encyclopedia of Mathematics and its Applications, vol. 17. Addison-Wesley, Reading (1983)Google Scholar
  6. 6.
    Lyndon, R.C.: On Burnside problem I. Trans. Am. Math. Soc. 77, 202–215 (1954)MathSciNetGoogle Scholar
  7. 7.
    Lyndon, R.C.: On Burnside problem II. Trans. Am. Math. Soc. 78, 329–332 (1954)MathSciNetGoogle Scholar
  8. 8.
    Melançon, G.: Lyndon factorization of infinite words. In: Puech, C., Reischuk, R. (eds.) STACS 96. LNCS, vol. 1046, pp. 147–154. Springer, Heidelberg (1996)CrossRefGoogle Scholar
  9. 9.
    Melançon, G.: Viennot factorization of infinite words. Inf. Process. Lett. 60(2), 53–57 (1996)CrossRefGoogle Scholar
  10. 10.
    Rosenstein, J.G.: Linear Ordering. Academic Press, New York (1982)Google Scholar
  11. 11.
    Siromoney, R., Mathew, L., Dare, V.R., Subramanian, K.G.: Infinite Lyndon words. Inf. Process. Lett. 50(2), 101–104 (1994)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2015

Authors and Affiliations

  1. 1.LIAFAUniversité Paris DiderotParisFrance

Personalised recommendations