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 Tools annual

Global: Zendy Free Plan

Global: Zendy Tools monthly

Global: Zendy Plus monthly

In this paper, we define from an infinite word u, the word by k to k erasure of a letter and the word of the erased letters. Then, we study the classical complexity and the palindromic complexity of these words in the case of modulo-recurrent words and more specifically in the Sturmian case. AMS Subject Classification: 68R15, 11B85

ABOUT THE WORDS BY $k$ TO $k$ ERASURE OF LETTER AND THE WORDS OF ERASED LETTERS: STURMIAN CASE