We study the relation between the palindromic and factor complexity of infinite words. We show that for uniformly recurrent words one has P(n) + P(n + 1) ≤ ∆C(n) + 2, for all n ∈ N. For a large class… (More)

We provide a complete characterization of substitution invariant inhomogeneous bidirectional pointed Sturmian sequences. The result is analogous to that obtained by Berthé et al. [5] and Yasutomi… (More)

We study infinite words coding an orbit under an exchange of three intervals which have full complexity C(n) = 2n + 1 for all n ∈ N (non-degenerate 3iet words). In terms of parameters of the interval… (More)

We study infinite words coding an orbit under an exchange of three intervals which have full complexity C(n) = 2n + 1 for all n ∈ N (non-degenerate 3iet words). In terms of parameters of the interval… (More)