On the 2-binomial complexity of the generalized Thue-Morse words
From MaRDI portal
Publication:6138835
DOI10.1016/j.tcs.2023.114342arXiv2112.05347MaRDI QIDQ6138835
Zhi Xiong Wen, Xiao-Tao Lü, Wen Wu, Jin Chen
Publication date: 16 January 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2112.05347
Related Items
On extended boundary sequences of morphic and Sturmian words, Characterizations of families of morphisms and words via binomial complexities
Cites Work
- Generalized Pascal triangle for binomial coefficients of words
- On a generalization of abelian equivalence and complexity of infinite words
- Another generalization of abelian equivalence: binomial complexity of infinite words
- Relations on words
- Thue-Morse sequence and p-adic topology for the free monoid
- The abelian complexity of the paperfolding word
- Binomial complexities and Parikh-collinear morphisms
- Avoiding abelian powers cyclically
- Avoiding 2-binomial squares and cubes
- Abelian properties of words
- Every nonnegative real number is an abelian critical exponent
- Abelian-square-rich words
- On the abelian complexity of the Rudin-Shapiro sequence
- On the abelian complexity of generalized Thue-Morse sequences
- A noncommutative extension of Mahler's theorem on interpolation series
- On the index of Simon's congruence for piecewise testability
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- Automatic Sequences
- Abelian squares are avoidable on 4 letters
- Sequences with minimal block growth
- Abelian returns in Sturmian words
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Templates for the \(k\)-binomial complexity of the Tribonacci word
