Problems in between words and abelian words: \(k\)-abelian avoidability
From MaRDI portal
Publication:714821
DOI10.1016/j.tcs.2012.03.010zbMath1280.68149MaRDI QIDQ714821
Mari Huova, Aleksi Saarela, Juhani Karhumäki
Publication date: 11 October 2012
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2012.03.010
68R15: Combinatorics on words
Related Items
Avoiding or Limiting Regularities in Words, FINE AND WILF'S THEOREM FOR k-ABELIAN PERIODS, A completeness proof for a regular predicate logic with undefined truth value, Abelian combinatorics on words: a survey, Maximum number of distinct and nonequivalent nonstandard squares in a word, Fast algorithms for abelian periods in words and greatest common divisor queries, On \(k\)-abelian avoidability, On a generalization of abelian equivalence and complexity of infinite words, \(k\)-abelian pattern matching, On some generalizations of abelian power avoidability, On growth and fluctuation of \(k\)-abelian complexity, On Growth and Fluctuation of k-Abelian Complexity
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Strongly non-repetitive sequences and progression-free sets
- On repeated factors in \(C^\infty\)-words
- Uniformly growing k-th power-free homomorphisms
- Local Squares, Periodicity and Finite Automata
- 2726. A problem on strings of beads
- Wiederholungsfreie Folgen
- Automatic Sequences
- Abelian squares are avoidable on 4 letters