scientific article; zbMATH DE number 3375509
From MaRDI portal
Publication:5646912
zbMath0237.05010MaRDI QIDQ5646912
Publication date: 1970
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (58)
Square-free words on partially commutative free monoids ⋮ Maximal abelian square-free words of short length. ⋮ Non-repetitive colorings of infinite sets ⋮ Repetition-free words ⋮ On uniformly repetitive semigroups ⋮ Applications of an infinite square-free co-CFL ⋮ A powerful abelian square-free substitution over 4 letters ⋮ On the structure and extendibility of \(k\)-power free words ⋮ Anagram-Free Colourings of Graphs ⋮ Long binary patterns are abelian 2-avoidable ⋮ Maximum number of distinct and nonequivalent nonstandard squares in a word ⋮ New second-preimage attacks on hash functions ⋮ Reduction in non-(k+ 1)-power-free morphisms ⋮ Fast algorithms for abelian periods in words and greatest common divisor queries ⋮ The complexity of unavoidable word patterns ⋮ Avoidable patterns on two letters ⋮ Non-repetitive words: Ages and essences ⋮ Facial anagram-free edge-coloring of plane graphs ⋮ On the generation of powers by OS schemes ⋮ \(2\times n\) grids have unbounded anagram-free chromatic number ⋮ Crucial words and the complexity of some extremal problems for sets of prohibited words ⋮ On abelian 2-avoidable binary patterns ⋮ On \(k\)-abelian avoidability ⋮ Pattern avoidance on graphs ⋮ On the number of Abelian square-free words on four letters ⋮ Infinite ternary square-free words concatenated from permutations of a single word ⋮ On nonrepetitive sequences ⋮ Strongly non-repetitive sequences and progression-free sets ⋮ Abelian combinatorics on words: a survey ⋮ Fixed points avoiding abelian \(k\)-powers ⋮ Mots sans carre et morphismes iterés ⋮ Avoiding or Limiting Regularities in Words ⋮ Avoiding Abelian squares in partial words ⋮ Permutations are not context-free: An application of the interchange lemma ⋮ 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 ⋮ Unnamed Item ⋮ Properties of integers and finiteness conditions for semigroups ⋮ The entropy of square-free words ⋮ Avoidability of long 𝑘-abelian repetitions ⋮ Chains and fixing blocks in irreducible binary sequences ⋮ Pattern avoidance: themes and variations ⋮ Partially abelian squarefree words ⋮ Problems in between words and abelian words: \(k\)-abelian avoidability ⋮ On two-sided infinite fixed points of morphisms ⋮ Abelian squares are avoidable on 4 letters ⋮ A cyclic binary morphism avoiding abelian fourth powers ⋮ Splitting necklaces and measurable colorings of the real line ⋮ Crucial Words for Abelian Powers ⋮ An infinite square-free co-CFL ⋮ On Abelian squares and substitutions ⋮ Repetitive perhaps, but certainly not boring ⋮ On the product of square-free words ⋮ On a generalization of Thue sequences ⋮ Every iterated morphism yields a co-CFL
This page was built for publication:
