On the number of Abelian square-free words on four letters
From MaRDI portal
Publication:1382260
DOI10.1016/S0166-218X(97)88002-XzbMath0894.68113MaRDI QIDQ1382260
Publication date: 25 March 1998
Published in: Discrete Applied Mathematics (Search for Journal in Brave)
Full work available at URL: http://www.elsevier.com/locate/dam
Related Items
Branching frequency and Markov entropy of repetition-free languages, A powerful abelian square-free substitution over 4 letters, On Abelian repetition threshold, The number of binary words avoiding Abelian fourth powers grows exponentially, Crucial words and the complexity of some extremal problems for sets of prohibited words, Abelian combinatorics on words: a survey, Growth rate of binary words avoiding \(xxx^{R}\), Avoiding or Limiting Regularities in Words, Avoiding Abelian squares in partial words, Abelian repetitions in partial words, On some generalizations of abelian power avoidability, Relations on words, Growth of repetition-free words -- a review, Avoidability of long 𝑘-abelian repetitions, Pattern avoidance: themes and variations, Crucial Words for Abelian Powers, On Abelian squares and substitutions
Cites Work
- Enumeration of irreducible binary words
- Avoidable patterns in strings of symbols
- Strongly non-repetitive sequences and progression-free sets
- Uniformly growing k-th power-free homomorphisms
- ON ABELIAN POWER-FREE MORPHISMS
- A linear-time algorithm to decide whether a binary word contains an overlap
- Abelian squares are avoidable on 4 letters
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
