A Separation of γ and b via Thue–Morse Words

04/19/2021
by   Hideo Bannai, et al.
0

We prove that for n≥ 2, the size b(t_n) of the smallest bidirectional scheme for the nth Thue–Morse word t_n is n+2. Since Kutsukake et al. [SPIRE 2020] show that the size γ(t_n) of the smallest string attractor for t_n is 4 for n ≥ 4, this shows for the first time that there is a separation between the size of the smallest string attractor γ and the size of the smallest bidirectional scheme b, i.e., there exist string families such that γ = o(b).

READ FULL TEXT

page 1

page 2

page 3

page 4

research
05/19/2020

On repetitiveness measures of Thue-Morse words

We show that the size γ(t_n) of the smallest string attractor of the nth...
research
07/06/2022

Computing NP-hard Repetitiveness Measures via MAX-SAT

Repetitiveness measures reveal profound characteristics of datasets, and...
research
05/28/2021

On Stricter Reachable Repetitiveness Measures*

The size b of the smallest bidirectional macro scheme, which is arguably...
research
12/12/2020

String Attractors for Automatic Sequences

We show that it is decidable, given an automatic sequence s and a consta...
research
12/20/2021

String Sampling with Bidirectional String Anchors

The minimizers sampling mechanism is a popular mechanism for string samp...
research
06/27/2022

Balancing Run-Length Straight-Line Programs*

It was recently proved that any SLP generating a given string w can be t...
research
06/03/2022

L-systems for Measuring Repetitiveness*

An L-system (for lossless compression) is a CPD0L-system extended with t...

Please sign up or login with your details

Forgot password? Click here to reset