Crochemore factorization of sturmian and other infinite words

  • Authors:
  • Jean Berstel;Alessandra Savelli

  • Affiliations:
  • Institut Gaspard Monge (IGM), Université de Marne-la-Vallée;,Institut Gaspard Monge (IGM), Université de Marne-la-Vallée

  • Venue:
  • MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
  • Year:
  • 2006

Quantified Score

Hi-index 0.00

Visualization

Abstract

The Crochemore factorization was introduced by Crochemore for the design of a linear time algorithm to detect squares in a word. We give here the explicit description of the Crochemore factorization for some classes of infinite words, namely characteristic Sturmian words, (generalized) Thue-Morse words, and the period doubling sequence.