On repetitiveness measures of Thue-Morse words
Data Structures and Algorithms
2020-08-13 v3 Discrete Mathematics
Abstract
We show that the size of the smallest string attractor of the th Thue-Morse word is 4 for any , disproving the conjecture by Mantaci et al. [ICTCS 2019] that it is . We also show that for , where is the maximum over all , the number of distinct substrings of length in divided by , which is a measure of repetitiveness recently studied by Kociumaka et al. [LATIN 2020]. Furthermore, we show that the number of factors in the self-referencing Lempel-Ziv factorization of is exactly .
Keywords
Cite
@article{arxiv.2005.09524,
title = {On repetitiveness measures of Thue-Morse words},
author = {Kanaru Kutsukake and Takuya Matsumoto and Yuto Nakashima and Shunsuke Inenaga and Hideo Bannai and Masayuki Takeda},
journal= {arXiv preprint arXiv:2005.09524},
year = {2020}
}
Comments
accepted to SPIRE 2020