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/

Global: Zendy Plus annual

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

Global: Zendy Plus monthly

Global: Zendy Tools annual

Global: Zendy Tools monthly

Global: Zendy Free Plan

Firstly studied by Kempa and Prezza in 2018 as the cement of text compressionalgorithms, string attractors have become a compelling object of theoreticalresearch within the community of combinatorics on words. In this context, theyhave been studied for several families of finite and infinite words. In thispaper, we obtain string attractors of prefixes of particular infinite wordsgeneralizing k-bonacci words (including the famous Fibonacci word) and obtainedas fixed points of k-bonacci-like morphisms. In fact, our description involvesthe numeration systems classically derived from the considered morphisms

String attractors of fixed points of k-bonacci-like morphisms