A powerful abelian square-free substitution over 4 letters

DOI10.1016/j.tcs.2009.05.027zbMath1172.68035MaRDI QIDQ837181

Veikko Keränen

Publication date: 10 September 2009

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2009.05.027

zbMATH Keywords

square-free; exponential growth; abelian square; repetition avoidance

Mathematics Subject Classification ID

68Q45: Formal languages and automata

Related Items

Avoiding or Limiting Regularities in Words, Anagram-Free Colorings of Graph Subdivisions, ALGORITHMIC COMBINATORICS ON PARTIAL WORDS, Abelian combinatorics on words: a survey, Avoiding Abelian squares in partial words, Abelian repetitions in partial words, Anagram-free graph colouring, \(2\times n\) grids have unbounded anagram-free chromatic number, Avoiding abelian powers cyclically, On Abelian repetition threshold

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The number of binary words avoiding Abelian fourth powers grows exponentially
• A cyclic binary morphism avoiding abelian fourth powers
• A characterization of power-free morphisms
• Strongly non-repetitive sequences and progression-free sets
• Sharp characterizations of squarefree morphisms
• On Abelian squares and substitutions
• On uniformly repetitive semigroups
• On the number of Abelian square-free words on four letters
• On nonrepetitive sequences
• Some results on \(k\)-power-free morphisms
• Words strongly avoiding fractional powers
• ON ABELIAN POWER-FREE MORPHISMS
• Abelian squares are avoidable on 4 letters
• Second Preimage Attacks on Dithered Hash Functions
• Partially abelian squarefree words