The number of binary words avoiding Abelian fourth powers grows exponentially
From MaRDI portal
Publication:596075
DOI10.1016/j.tcs.2004.02.005zbMath1068.68113OpenAlexW2065463697MaRDI QIDQ596075
Publication date: 10 August 2004
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2004.02.005
Related Items
Branching frequency and Markov entropy of repetition-free languages, A powerful abelian square-free substitution over 4 letters, On Abelian repetition threshold, Dynamical systems arising from random substitutions, Abelian combinatorics on words: a survey, Avoiding or Limiting Regularities in Words, Abelian repetitions in partial words, Avoiding abelian powers cyclically, A cyclic binary morphism avoiding abelian fourth powers
Cites Work
- Unnamed Item
- Growth problems for avoidable words
- Strongly non-repetitive sequences and progression-free sets
- On the number of Abelian square-free words on four letters
- Uniformly growing k-th power-free homomorphisms
- Avoiding Patterns in the Abelian Sense
- NON-REPETITIVE SEQUENCES ON THREE SYMBOLS
- Abelian squares are avoidable on 4 letters
