On Growth and Fluctuation of k-Abelian Complexity
From MaRDI portal
Publication:3194711
DOI10.1007/978-3-319-20297-6_8zbMath1464.68303OpenAlexW960031670MaRDI QIDQ3194711
Julien Cassaigne, Juhani Karhumäki, Aleksi Saarela
Publication date: 20 October 2015
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-20297-6_8
Related Items (5)
Weighted prefix normal words: mind the gap ⋮ Note on occurrences of factors in circular words ⋮ On the \(k\)-abelian complexity of the Cantor sequence ⋮ Relations on words ⋮ k-Abelian Equivalence and Rationality
Cites Work
- On a generalization of abelian equivalence and complexity of infinite words
- On some generalizations of abelian power avoidability
- On the 2-abelian complexity of the Thue-Morse word
- Problems in between words and abelian words: \(k\)-abelian avoidability
- Strongly non-repetitive sequences and progression-free sets
- Toeplitz words, generalized periodicity and periodically iterated morphisms
- A new approach to the 2-regularity of the \(\ell\)-abelian complexity of 2-automatic sequences
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- 5-Abelian cubes are avoidable on binary alphabets
- Local Squares, Periodicity and Finite Automata
- Hereditary properties of words
- Abelian squares are avoidable on 4 letters
- 3-Abelian Cubes Are Avoidable on Binary Alphabets
- 0-1-sequences of Toeplitz type
- Sequences with minimal block growth
This page was built for publication: On Growth and Fluctuation of k-Abelian Complexity
