Infinite words with linear subword complexity
Theoretical Computer Science - Conference on arithmetics and coding systems, Marseille-Luminy, June 1987
On the factors of the Sturmian sequences
Theoretical Computer Science
A division property of the Fibonacci word
Information Processing Letters
Some combinatorial properties of Sturmian words
Theoretical Computer Science
Sturmian words, Lyndon words and trees
Theoretical Computer Science
&agr;-words and factors of characteristic sequences
Discrete Mathematics
A representation theorem of the suffixes of characteristic sequences
Discrete Applied Mathematics
Unbordered factors of the characteristic sequences of irrational numbers
Theoretical Computer Science
Sturmian morphisms and &agr;-words
Theoretical Computer Science
Factors of characteristic words of irrational numbers
Theoretical Computer Science
Factors of characteristic words of irrational numbers
Theoretical Computer Science
Some characterizations of finite Sturmian words
Theoretical Computer Science - In honour of Professor Christian Choffrut on the occasion of his 60th birthday
Sturmian and episturmian words: a survey of some recent results
CAI'07 Proceedings of the 2nd international conference on Algebraic informatics
Factors of characteristic words: Location and decompositions
Theoretical Computer Science
Theoretical Computer Science
Hi-index | 5.23 |
For each nonempty binary word w = c1c2...Cq, where ci ∈ {0, 1}, the nonnegative integer Σi=1q (q + 1 - i)ci is called the moment of w and is denoted by M(w). Let [w] denote the conjugacy class of w. Define M([w]) = {M(u): u ∈ [w]}, N(w) = {M(u) - M(w): u ∈ [w]} and δ(w) = max{M(u) - M(v): u, v ∈ [w]}. Using these objects, we obtain equivalent conditions for a binary word to be an α-word (respectively, a power of an α-word). For instance, we prove that the following statements are equivalent for any binary word w with |w| ≥ 2: (a) w is an α-word, (b) δ(w)= |w| - 1, (c) w is a cyclic balanced primitive word, (d) M([w]) is a set of |w| consecutive positive integers, (c) N(w) is a set of |w| consecutive integers and 0 ∈ N(w), (f) w is primitive and [w] ⊂ St.