On \(k\)-abelian palindromes
From MaRDI portal
Publication:1753996
DOI10.1016/j.ic.2018.04.001zbMath1393.68138OpenAlexW2795583685MaRDI QIDQ1753996
Julien Cassaigne, Svetlana Puzynina, Juhani Karhumäki
Publication date: 30 May 2018
Published in: Information and Computation (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.ic.2018.04.001
Related Items (6)
Abelian combinatorics on words: a survey ⋮ A compactness property of the \(k\)-abelian monoids ⋮ Finite and infinite closed-rich words ⋮ Characterizations of families of morphisms and words via binomial complexities ⋮ On abelian saturated infinite words ⋮ On closed-rich words
Cites Work
- Unnamed Item
- Unnamed Item
- On the least number of palindromes contained in an infinite word
- On a generalization of abelian equivalence and complexity of infinite words
- Weak abelian periodicity of infinite words
- The ``runs conjecture
- The number of positions starting a square in binary words
- Palindromic richness
- Sturmian words: structure, combinatorics, and their arithmetics
- Balances for fixed points of primitive substitutions.
- Palindrome complexity bounds for primitive substitution sequences
- Palindrome complexity.
- How many square occurrences must a binary sequence contain?
- A new characteristic property of rich words
- Palindromic complexity of infinite words associated with simple Parry numbers
- A note on the number of squares in a word
- Another Generalization of Abelian Equivalence: Binomial Complexity of Infinite Words
- On abelian versions of critical factorization theorem
- On k-Abelian Palindromic Rich and Poor Words
- ON THE PALINDROMIC COMPLEXITY OF INFINITE WORDS
- Abelian complexity of minimal subshifts
- Automatic Sequences
- Abelian squares are avoidable on 4 letters
- The “Runs” Theorem
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS
- Abelian returns in Sturmian words
- Episturmian words and some constructions of de Luca and Rauzy
This page was built for publication: On \(k\)-abelian palindromes
