International audienceThe paper deals with balances and imbalances in Arnoux-Rauzy words. We provide sufficient conditions for $C$-balancedness, but our results indicate that even a characterization of 2-balanced Arnoux-Rauzy words on a 3-letter alphabet is not immediate
AbstractConsider to construct an infinite sequence, or an infinite word, from a finite set of letter...
\u27Balanced Words\u27 anagrams to \u27An ABCDE\u27s World\u27. It is certainly that! Ironically, ...
AbstractThree new characterisations of balanced words are presented. Each of these characterisations...
International audienceWe study balancedness properties of words given by the Arnoux-Rauzy and Brun m...
AbstractAn infinite word defined over a finite alphabet A is balanced if for any pair (ω,ω′) of fact...
AbstractOne of the numerous characterizations of Sturmian words is based on the notion of balance. A...
A set of words, also called a language, is letter-balanced if the number of occurrences of each lett...
In this thesis, I develop a semi-algorithm consisting of an automaton, or rather, an ever-building f...
AbstractA word u is called 1-balanced if for any two factors v and w of u of equal length, we have −...
International audienceWe characterize the clustering of a word under the Burrows-Wheeler transform i...
An infinite word generated by a substitution is rigid if all the substitutions which fix this word a...
We conjecture that each balanced word on N letters - either arises from a balanced word on two lett...
We study balance properties of circular words over alphabets of size greater than two. We give some ...
A word u defined over an alphabet $\mathcal A$ is c-balanced (c ∈ $\mathbb N$) if for all pairs of f...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractConsider to construct an infinite sequence, or an infinite word, from a finite set of letter...
\u27Balanced Words\u27 anagrams to \u27An ABCDE\u27s World\u27. It is certainly that! Ironically, ...
AbstractThree new characterisations of balanced words are presented. Each of these characterisations...
International audienceWe study balancedness properties of words given by the Arnoux-Rauzy and Brun m...
AbstractAn infinite word defined over a finite alphabet A is balanced if for any pair (ω,ω′) of fact...
AbstractOne of the numerous characterizations of Sturmian words is based on the notion of balance. A...
A set of words, also called a language, is letter-balanced if the number of occurrences of each lett...
In this thesis, I develop a semi-algorithm consisting of an automaton, or rather, an ever-building f...
AbstractA word u is called 1-balanced if for any two factors v and w of u of equal length, we have −...
International audienceWe characterize the clustering of a word under the Burrows-Wheeler transform i...
An infinite word generated by a substitution is rigid if all the substitutions which fix this word a...
We conjecture that each balanced word on N letters - either arises from a balanced word on two lett...
We study balance properties of circular words over alphabets of size greater than two. We give some ...
A word u defined over an alphabet $\mathcal A$ is c-balanced (c ∈ $\mathbb N$) if for all pairs of f...
AbstractWe focus on infinite words with languages closed under reversal. If frequencies of all facto...
AbstractConsider to construct an infinite sequence, or an infinite word, from a finite set of letter...
\u27Balanced Words\u27 anagrams to \u27An ABCDE\u27s World\u27. It is certainly that! Ironically, ...
AbstractThree new characterisations of balanced words are presented. Each of these characterisations...
DOI
Add to ORKG