scientific article; zbMATH DE number 3375509

Cited in

(59)

A cyclic binary morphism avoiding abelian fourth powers
On the product of square-free words
Every iterated morphism yields a co-CFL
Square-free words on partially commutative free monoids
Repetition-free words
Applications of an infinite square-free co-CFL
Avoidable patterns on two letters
On the generation of powers by OS schemes
Strongly non-repetitive sequences and progression-free sets
Mots sans carre et morphismes iterés
Permutations are not context-free: An application of the interchange lemma
On Abelian squares and substitutions
On uniformly repetitive semigroups
On the number of Abelian square-free words on four letters
On nonrepetitive sequences
Repetitive perhaps, but certainly not boring
Maximal abelian square-free words of short length.
Non-repetitive colorings of infinite sets
On the structure and extendibility of \(k\)-power free words
Non-repetitive words: Ages and essences
The complexity of unavoidable word patterns
2 n grids have unbounded anagram-free chromatic number
Avoiding abelian powers cyclically
On highly palindromic words: the \(n\)-ary case
Chains and fixing blocks in irreducible binary sequences
On a generalization of Thue sequences
Long binary patterns are abelian 2-avoidable
Facial anagram-free edge-coloring of plane graphs
Maximum number of distinct and nonequivalent nonstandard squares in a word
Anagram-free colourings of graphs
Reduction in non-(k+1)-power-free morphisms
New second-preimage attacks on hash functions
Fast algorithms for abelian periods in words and greatest common divisor queries
Splitting necklaces and measurable colorings of the real line
Crucial Words for Abelian Powers
On \(k\)-abelian avoidability
Infinite ternary square-free words concatenated from permutations of a single word
scientific article; zbMATH DE number 3770980 (Why is no real title available?)
Fixed points avoiding abelian k-powers
Avoiding or limiting regularities in words
On some generalizations of abelian power avoidability
Abelian squares are avoidable on 4 letters
Pattern avoidance: themes and variations
Avoidability of long k-abelian repetitions
Partially abelian squarefree words
On two-sided infinite fixed points of morphisms
Crucial words and the complexity of some extremal problems for sets of prohibited words
Abelian combinatorics on words: a survey
Avoiding Abelian squares in partial words
Abelian repetitions in partial words
A small morphism for which the fixed point has an abelian critical exponent less than 2
Properties of integers and finiteness conditions for semigroups
Problems in between words and abelian words: \(k\)-abelian avoidability
An infinite square-free co-CFL
A powerful abelian square-free substitution over 4 letters
On abelian 2-avoidable binary patterns
Pattern avoidance on graphs
Thue type problems for graphs, points, and numbers
The entropy of square-free words

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5646912)