On cardinalities of \(k\)-abelian equivalence classes
From MaRDI portal
Publication:728280
DOI10.1016/j.tcs.2016.06.010zbMath1356.68166arXiv1605.03319OpenAlexW2963619970MaRDI QIDQ728280
Markus A. Whiteland, Juhani Karhumäki, Svetlana Puzynina, Michaël Rao
Publication date: 19 December 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1605.03319
Related Items (5)
Reverse-Safe Text Indexing ⋮ Abelian combinatorics on words: a survey ⋮ Regularity of k-Abelian Equivalence Classes of Fixed Cardinality ⋮ The binomial equivalence classes of finite words ⋮ k-Abelian Equivalence and Rationality
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- On a generalization of abelian equivalence and complexity of infinite words
- \(k\)-abelian pattern matching
- Gray-ordered binary necklaces
- Uniform words
- A proof of Golomb's conjecture for the de Bruijn graph
- Strongly k-Abelian Repetitions
- Variations of the Morse-Hedlund Theorem for k-Abelian Equivalence
- Computing Binary Combinatorial Gray Codes Via Exhaustive Search With SAT Solvers
- A Survey of Combinatorial Gray Codes
- An Efficient Algorithm for Generating Necklaces with Fixed Density
- FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS
This page was built for publication: On cardinalities of \(k\)-abelian equivalence classes