English (United Kingdom)

https://curated-unify.zendy.io/wp-json/zendy-region/v1/featured_content/oa?rat=en

https://curated-unify.zendy.io/wp-json/zendy-region/v1/highlighted_journal/

Zendy Plus

Presents the access of premium content as premium feature

Premium Content

Presents the keyphrase highlighting as premium feature

Keyphrase Highlighting

Presents the summarisation as premium feature

Summarisation

Insights

Presents the pdf analysis as premium feature

PDF Analysis

Presents the zaia usage as premium feature

ZAIA

Zendy Tools

Zendy Open

We prove that for $n\geq 2$, the size $b(t_n)$ of the smallest bidirectionalscheme for the $n$th Thue--Morse word $t_n$ is $n+2$. Since Kutsukake et al.[SPIRE 2020] show that the size $\gamma(t_n)$ of the smallest string attractorfor $t_n$ is $4$ for $n \geq 4$, this shows for the first time that there is aseparation between the size of the smallest string attractor $\gamma$ and thesize of the smallest bidirectional scheme $b$, i.e., there exist stringfamilies such that $\gamma = o(b)$.

A Separation of $\gamma$ and $b$ via Thue--Morse Words