The Smallest String Attractors of Fibonacci, Period-Doubling, and Thue--Morse Words

A string attractor of a string $T[1..|T|]$ is a set of positions $Γ$ of $T$ such that any nonempty substring $w$ of $T$ has an occurrence that crosses a position in $Γ$, i.e., there is a position $i$ such that $w = T[i..i+|w|-1]$ and the intersection $[i,i+|w|-1]\cap Γ$ is nonempty. The size of the