Characterizations of families of morphisms and words via binomial complexities
From MaRDI portal
Publication:6201915
DOI10.1016/j.ejc.2024.103932arXiv2201.04603MaRDI QIDQ6201915
Markus A. Whiteland, Michel Rigo, Manon Stipulanti
Publication date: 26 March 2024
Published in: European Journal of Combinatorics (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2201.04603
Theory of computing (68Qxx) Sequences and sets (11Bxx) Discrete mathematics in relation to computer science (68Rxx)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Generalized Pascal triangle for binomial coefficients of words
- Introducing privileged words: privileged complexity of Sturmian 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
- Cyclic complexity of words
- On factorially balanced sets of words
- Some unsolved problems
- Some characterizations of Parikh matrix equivalent binary words
- Thue, combinatorics on words, and conjectures inspired by the Thue-Morse sequence
- Balance and abelian complexity of the Tribonacci word
- Thue-Morse sequence and p-adic topology for the free monoid
- Reconstruction of sequences
- Balances for fixed points of primitive substitutions.
- On \(k\)-abelian palindromes
- Palindromes and Sturmian words
- Equations over the \(k\)-binomial monoids
- Binomial complexities and Parikh-collinear morphisms
- On growth and fluctuation of \(k\)-abelian complexity
- A noncommutative extension of Mahler's theorem on interpolation series
- On the complexity of algebraic numbers. I: Expansions in integer bases
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- Automatic Sequences
- Sequence entropy and the maximal pattern complexity of infinite words
- The Logical Approach to Automatic Sequences
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- A characterization of words of linear complexity
- Constructions of strictly ergodic systems
- Sequences with minimal block growth
- Computing the \(k\)-binomial complexity of the Thue-Morse word
- Templates for the \(k\)-binomial complexity of the Tribonacci word
- Abelian combinatorics on words: a survey
- Automaticity and Parikh-Collinear Morphisms
- On the 2-binomial complexity of the generalized Thue-Morse words
- Reconstructing Words from Right-Bounded-Block Words
