On a generalization of abelian equivalence and complexity of infinite words
From MaRDI portal
Publication:388738
DOI10.1016/j.jcta.2013.08.008zbMath1278.05009arXiv1301.5104OpenAlexW2012233760MaRDI QIDQ388738
Aleksi Saarela, Luca Q. Zamboni, Juhani Karhumäki
Publication date: 6 January 2014
Published in: Journal of Combinatorial Theory. Series A (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1301.5104
Related Items
Computing abelian complexity of binary uniform morphic words ⋮ Cyclic Complexity of Words ⋮ On Growth and Fluctuation of k-Abelian Complexity ⋮ Binomial complexities and Parikh-collinear morphisms ⋮ On growth and fluctuation of \(k\)-abelian complexity ⋮ Lower bounds on words separation: are there short identities in transformation semigroups? ⋮ Abelian periods of factors of Sturmian words ⋮ Reverse-Safe Text Indexing ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ Abelian combinatorics on words: a survey ⋮ A compactness property of the \(k\)-abelian monoids ⋮ On extended boundary sequences of morphic and Sturmian words ⋮ On the 2-binomial complexity of the generalized Thue-Morse words ⋮ Regularity of k-Abelian Equivalence Classes of Fixed Cardinality ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding abelian powers cyclically ⋮ On $k$-abelian equivalence and generalized Lagrange spectra ⋮ \(k\)-abelian pattern matching ⋮ On some generalizations of abelian power avoidability ⋮ Another generalization of abelian equivalence: binomial complexity of infinite words ⋮ On the additive complexity of a Thue-Morse-like sequence ⋮ On the 2-abelian complexity of the Thue-Morse word ⋮ Relations on words ⋮ Separating the Words of a Language by Counting Factors ⋮ On \(k\)-abelian palindromes ⋮ A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences ⋮ Avoiding 2-binomial squares and cubes ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Unnamed Item ⋮ Avoiding Two Consecutive Blocks of Same Size and Same Sum over $\mathbb{Z}^2$ ⋮ On cardinalities of \(k\)-abelian equivalence classes ⋮ Computing the \(k\)-binomial complexity of the Thue-Morse word ⋮ Templates for the \(k\)-binomial complexity of the Tribonacci word ⋮ The binomial equivalence classes of finite words ⋮ k-Abelian Equivalence and Rationality ⋮ On abelian saturated infinite words ⋮ On the 2-abelian complexity of generalized Cantor sequences ⋮ On the Lie complexity of Sturmian words
Cites Work
- Unnamed Item
- Unnamed Item
- Recurrent words with constant abelian complexity
- Infinite permutations of lowest maximal pattern complexity
- Problems in between words and abelian words: \(k\)-abelian avoidability
- Balance and abelian complexity of the Tribonacci word
- Strongly non-repetitive sequences and progression-free sets
- Elementary homomorphisms and a solution of the DOL sequence equivalence problem
- Generalized balances in Sturmian words
- On cube-free \(\omega\)-words generated by binary morphisms
- On periodicity and low complexity of infinite permutations
- Existence of an infinite ternary 64-abelian square-free word
- Some characterizations of Sturmian words in terms of the lexicographic order
- 5-Abelian cubes are avoidable on binary alphabets
- AVOIDING ABELIAN POWERS IN BINARY WORDS WITH BOUNDED ABELIAN COMPLEXITY
- Abelian complexity of minimal subshifts
- Generalized Parikh mappings and homomorphisms
- Repetitions in the Fibonacci infinite word
- A generalization of Sturmian sequences: Combinatorial structure and transcendence
- Sequence entropy and the maximal pattern complexity of infinite words
- Abelian squares are avoidable on 4 letters
- 3-Abelian Cubes Are Avoidable on Binary Alphabets
- Sequences with minimal block growth
- A variant of a recursively unsolvable problem
- Abelian returns in Sturmian words
- Episturmian words and some constructions of de Luca and Rauzy
- On factor graphs of DOL words
