Add to ORKGAbstract. We study the palindromic complexity of infinite words u β , the fixed points of the substitution over a binary alphabet, ϕ(0) = 0 a 1, ϕ(1) = 0 b 1, with a − 1 ≥ b ≥ 1, which are canonically associated with quadratic non-simple Parry numbers β
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
We present a method which displays all palindromes of a given length from De Bruijn words of a certa...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over ...
AbstractWe consider one-sided infinite words generated via iteration by primitive substitutions on f...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eve...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe derive an explicit formula for the Abelian complexity of infinite words associated with q...
This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of...
AbstractIn this note, we state a conjecture, and prove it in the periodic case, which is an equality...
Most of the constructions of infinite words having polynomial subword complexity are quite complicat...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
We present a method which displays all palindromes of a given length from De Bruijn words of a certa...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...
We study the palindromic complexity of infinite words uβ, the fixed points of the substitution over ...
AbstractWe consider one-sided infinite words generated via iteration by primitive substitutions on f...
AbstractWe study the palindrome complexity of infinite sequences on finite alphabets, i.e., the numb...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
A Parry number is a real number β > 1 such that the Rényi β-expansion of 1 is finite or infinite eve...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe derive an explicit formula for the Abelian complexity of infinite words associated with q...
This thesis deals with Abelian complexity of infinite words, i.e., function describing complexity of...
AbstractIn this note, we state a conjecture, and prove it in the periodic case, which is an equality...
Most of the constructions of infinite words having polynomial subword complexity are quite complicat...
AbstractWe describe some combinatorial properties of an intriguing class of infinite words, called s...
International audienceWe regard a finite word u=u_1u_2 ... u_n up to word isomorphism as an equivale...
We present a method which displays all palindromes of a given length from De Bruijn words of a certa...
A finite word w of length n contains at most n + 1 distinct palindromic factors. If the bound n + 1 ...