AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (assumed to be infinite) of all lengths of palindromic prefixes of w. In this text, we give an explicit construction of all words w such that ni+1⩽2ni+1 for all i, and study these words. Special examples include characteristic Sturmian words, and more generally standard episturmian words. As an application, we study the values taken by the quantity lim supni+1/ni, and prove that it is minimal (among all nonperiodic words) for the Fibonacci word
AbstractCentral words are the palindromic prefixes of all standard Sturmian words. In 1997, the auth...
AbstractOriginally introduced and studied by the third and fourth authors together with J. Justin an...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractEpisturmian words are a suitable generalization to arbitrary alphabets of Sturmian words. In...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractCentral words are the palindromic prefixes of all standard Sturmian words. In 1997, the auth...
AbstractOriginally introduced and studied by the third and fourth authors together with J. Justin an...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...
AbstractLet w be an infinite word on an alphabet A. We denote by (ni)i⩾1 the increasing sequence (as...
AbstractIn this paper, we study combinatorial and structural properties of a new class of finite and...
Motivated by a conjecture of Frid, Puzynina, and Zamboni, we investigate infinite words with the pro...
AbstractThe palindrome complexity function palw of a word w attaches to each n∈N the number of palin...
AbstractAn infinite word x over the alphabet A is Sturmian if and only if gx(n) = n + 1 for any inte...
AbstractEpisturmian words are a suitable generalization to arbitrary alphabets of Sturmian words. In...
In this paper we prove that for any infinite word w whose set of factors is closed under reversal. t...
We study infinite words u over an alphabet $\mathcal{A}$ satisfying the property $\mathcal{P} :~\ma...
AbstractWe study the relation between the palindromic and factor complexity of infinite words. We sh...
AbstractWe consider involutory antimorphisms ϑ of a free monoid A* and their fixed points, called ϑ-...
AbstractIn this paper we study some classes of infinite words generalizing episturmian words, and an...
AbstractIn this paper we study generalization of the reversal mapping realized by an arbitrary invol...
AbstractCentral words are the palindromic prefixes of all standard Sturmian words. In 1997, the auth...
AbstractOriginally introduced and studied by the third and fourth authors together with J. Justin an...
AbstractThis paper concerns a specific class of strict standard episturmian words whose directive wo...