Computing the \(k\)-binomial complexity of the Thue-Morse word
From MaRDI portal
Publication:5918904
DOI10.1016/j.jcta.2020.105284zbMath1455.68153OpenAlexW2966024621MaRDI QIDQ5918904
Marie Lejeune, Michel Rigo, Julien Leroy
Publication date: 7 September 2020
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jcta.2020.105284
Related Items (7)
Weighted prefix normal words: mind the gap ⋮ Binomial complexities and Parikh-collinear morphisms ⋮ Absent Subsequences in Words ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ Expansions of generalized Thue-Morse numbers ⋮ GAPS IN THE THUE–MORSE WORD
Uses Software
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Pascal triangle for binomial coefficients of words
- On a generalization of abelian equivalence and complexity of infinite words
- Deciding context equivalence of binary overlap-free words in linear time
- Another generalization of abelian equivalence: binomial complexity of infinite words
- On the 2-abelian complexity of the Thue-Morse word
- Relations on words
- Sequences of linear arithmetical complexity
- Substitutions in dynamics, arithmetics and combinatorics
- Euler, Pisot, Prouhet-Thue-Morse, Wallis and the duplication of sines
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups
- Thue-Morse sequence and p-adic topology for the free monoid
- Reconstruction of sequences
- Power of words and recognizability of fixpoints of a substitution
- Enumeration of factors in the Thue-Morse word
- Avoiding 2-binomial squares and cubes
- On the arithmetical complexity of Sturmian words
- A noncommutative extension of Mahler's theorem on interpolation series
- On the index of Simon's congruence for piecewise testability
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- Formal Languages, Automata and Numeration Systems 1
- Abelian complexity of minimal subshifts
- On Some two way Classifications of Integers
- Automatic Sequences
- Reconnaissabilité des substitutions et complexité des suites automatiques
- A Short Proof of the Transcendence of Thue-Morse Continued Fractions
- Sequences with minimal block growth
- Computing the \(k\)-binomial complexity of the Thue-Morse word
This page was built for publication: Computing the \(k\)-binomial complexity of the Thue-Morse word
