Abstract. Let γ ( n ) be the number of C ∞ -words of length n . Say that a C ∞ -word w is left doubly extendable (LDE) if both 1 w and 2 w are C ∞ .

A note on the complexity of C∞-words. Yun Bao Huanga, William D. Weakleyb ... Any subword of a C∞-word is also C∞. Each C∞-word has left and right C ...

Let γ(n) be the number of C ∞ -words of length n. We say that a C ∞ -word w is left doubly extendable (LDE) if both 1w and 2w are C ∞ .

TL;DR: It is shown that, for any positive integer n, only finitely many words can occur twice, at distance n, in a C ∞ -word, which solves the conjecture of ...

Let p"i(n) denote the number of the C^~-words of form w@?xw with length 2n+i and gap i, where i is the length of word x. In this paper, we prove the ...

In computer science, the complexity function of a word or string is the function that counts the number of distinct factors (substrings of consecutive ...

ABSTRACT. With ideas from data compression and combinatorics on words, we introduce a complexity measure for words, called repetition complexity, ...

Mar 19, 2019 · Abstract. We introduce and study a complexity function on words cx(n), called cyclic complexity, which counts.

The complexity of words is a continuously growing field of the combinatorics of words. Hundreds of papers are devoted to different kind of complexities.

Aug 6, 2024 · The complexity function of every aperiodic function is non-decreasing, submultiplicative and grows at least linearly. We prove that conversely, ...