18 citations · 84 across the 20 of their papers we have counts for
6 papers · 1 filter
A Set of Sequences of Complexity
Julien Cassaigne, Sébastien Labbé, Julien Leroy
We prove the existence of a ternary sequence of factor complexity for any given vector of rationally independent letter frequencies. Such sequences are constructed from an i…
Cost and dimension of words of zero topological entropy
Julien Cassaigne, Anna E. Frid, Svetlana Puzynina +1
Let denote the free monoid generated by a finite nonempty set In this paper we introduce a new measure of complexity of languages defined in terms of th…
Invariant games and non-homogeneous Beatty sequences
Julien Cassaigne, Eric Duchêne, Michel Rigo
We characterize all the pairs of complementary non-homogenous Beatty sequences and for which there exists an invariant game having exactly $\{(A_n…
Avoiding Abelian powers in binary words with bounded Abelian complexity
Julien Cassaigne, Gwénaël Richomme, Kalle Saari +1
The notion of Abelian complexity of infinite words was recently used by the three last authors to investigate various Abelian properties of words. In particular, using van der Waer…
On possible growth of Toeplitz languages
Julien Cassaigne, Anna Frid, Fedor Petrov
We consider a new family of factorial languages whose subword complexity grows as , where is the root of some transcendent equation. Analytical methods and in particula…
Palindrome complexity
Jean-Paul Allouche, Michael Baake, Julien Cassaigne +1
We study the palindrome complexity of infinite sequences on finite alphabets, i.e., the number of palindromic factors (blocks) of given length occurring in a given sequence. We sur…