On the 2-binomial complexity of the generalized Thue-Morse words
From MaRDI portal
Publication:6138835
Abstract: In this paper, we study the -binomial complexity of the generalized Thue-Morse words for every integer . We obtain the exact value of for every integer . As a consequence, is ultimately periodic with period . This result partially answers a question of M. Lejeune, J. Leroy and M. Rigo [Computing the -binomial complexity of the Thue-Morse word, J. Comb. Theory Ser. A, {�f 176} (2020) 105284].
Cites work
- A noncommutative extension of Mahler's theorem on interpolation series
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- Abelian properties of words
- Abelian returns in Sturmian words
- Abelian squares are avoidable on 4 letters
- Abelian-square-rich words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Automatic Sequences
- Avoiding 2-binomial squares and cubes
- Avoiding abelian powers cyclically
- Binomial complexities and Parikh-collinear morphisms
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Every nonnegative real number is an abelian critical exponent
- Generalized Pascal triangle for binomial coefficients of words
- On a generalization of abelian equivalence and complexity of infinite words
- On the abelian complexity of generalized Thue-Morse sequences
- On the abelian complexity of the Rudin-Shapiro sequence
- On the index of Simon's congruence for piecewise testability
- Relations on words
- Sequences with minimal block growth
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- The abelian complexity of the paperfolding word
- Thue-Morse sequence and p-adic topology for the free monoid
Cited in
(2)
This page was built for publication: On the 2-binomial complexity of the generalized Thue-Morse words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6138835)