On repetitiveness measures of Thue-Morse words

05/19/2020
by   Kanaru Kutsukake, et al.
0

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

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/19/2021

A Separation of γ and b via Thue–Morse Words

We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional sc...
research
06/02/2021

Counting Lyndon Subsequences

Counting substrings/subsequences that preserve some property (e.g., pali...
research
12/19/2018

Efficient Representation and Counting of Antipower Factors in Words

A k-antipower (for k > 2) is a concatenation of k pairwise distinct word...
research
07/05/2023

Compressibility measures for two-dimensional data

In this paper we extend to two-dimensional data two recently introduced ...
research
11/23/2022

Schrödinger's Bat: Diffusion Models Sometimes Generate Polysemous Words in Superposition

Recent work has shown that despite their impressive capabilities, text-t...
research
05/11/2021

The explicit formula of the distributions of the nonoverlapping words and its applications to statistical tests for random numbers

Bassino et al. 2010 and Regnier et al. 1998 showed the generating functi...

Please sign up or login with your details

Forgot password? Click here to reset