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. © Springer-Verlag Berlin Heidelberg 2006.
Cite
CITATION STYLE
Berstel, J., & Savelli, A. (2006). Crochemore factorization of sturmian and other infinite words. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4162 LNCS, pp. 157–166). Springer Verlag. https://doi.org/10.1007/11821069_14
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
