scientific article; zbMATH DE number 3296252
From MaRDI portal
Publication:5579506
zbMath0186.01504MaRDI QIDQ5579506
Publication date: 1968
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (30)
Anagram-Free Colourings of Graphs ⋮ Long binary patterns are abelian 2-avoidable ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ The complexity of unavoidable word patterns ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ \(2\times n\) grids have unbounded anagram-free chromatic number ⋮ Crucial words and the complexity of some extremal problems for sets of prohibited words ⋮ Sequence avoiding any complete word ⋮ On \(k\)-abelian avoidability ⋮ On the number of Abelian square-free words on four letters ⋮ Strongly non-repetitive sequences and progression-free sets ⋮ Abelian combinatorics on words: a survey ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding Abelian squares in partial words ⋮ Abelian repetitions in partial words ⋮ Avoiding abelian powers cyclically ⋮ On highly palindromic words: the \(n\)-ary case ⋮ Thue type problems for graphs, points, and numbers ⋮ On some generalizations of abelian power avoidability ⋮ Weak abelian periodicity of infinite words ⋮ Strongly Asymmetric Sequences Generated by Four Elements ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Crucial Words for Abelian Powers ⋮ Characterization of the repetitive commutative semigroups ⋮ On Abelian squares and substitutions ⋮ Abelian repetition threshold revisited ⋮ On a generalization of Thue sequences
This page was built for publication:
