Abstract

We show that the size γ(tn)γ(t_n) of the smallest string attractor of the nnth Thue-Morse word tnt_n is 4 for any n≥4n\geq 4, disproving the conjecture by Mantaci et al. [ICTCS 2019] that it is nn. We also show that δ(tn)=103+24−nδ(t_n) = \frac{10}{3+2^{4-n}} for n≥3n \geq 3, where δ(w)δ(w) is the maximum over all k=1,…,∣w∣k = 1,\ldots,|w|, the number of distinct substrings of length kk in ww divided by kk, which is a measure of repetitiveness recently studied by Kociumaka et al. [LATIN 2020]. Furthermore, we show that the number z(tn)z(t_n) of factors in the self-referencing Lempel-Ziv factorization of tnt_n is exactly 2n2n.

Explore this paper’s authors, topics and related work.

Building this map preview

BZPEER is loading the nearby papers, people, topics and institutions for this page.

Reviews 0

Write a reviewWrite

No reviews yet.

Discussion 0

Add a commentWrite

No comments yet.