The following pages link to (Q5646912):
Displayed 42 items.
- On \(k\)-abelian avoidability (Q376138) (← links)
- Infinite ternary square-free words concatenated from permutations of a single word (Q390906) (← links)
- Fixed points avoiding abelian \(k\)-powers (Q412180) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Crucial words and the complexity of some extremal problems for sets of prohibited words (Q598457) (← links)
- Avoiding Abelian squares in partial words (Q645980) (← links)
- Abelian repetitions in partial words (Q651057) (← links)
- Properties of integers and finiteness conditions for semigroups (Q689894) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- An infinite square-free co-CFL (Q761044) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- The entropy of square-free words (Q967942) (← links)
- A cyclic binary morphism avoiding abelian fourth powers (Q1001897) (← links)
- On the product of square-free words (Q1060021) (← links)
- Every iterated morphism yields a co-CFL (Q1069710) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- Repetition-free words (Q1078338) (← links)
- Applications of an infinite square-free co-CFL (Q1088415) (← links)
- Avoidable patterns on two letters (Q1114419) (← links)
- On the generation of powers by OS schemes (Q1116709) (← links)
- Strongly non-repetitive sequences and progression-free sets (Q1141145) (← links)
- Mots sans carre et morphismes iterés (Q1144665) (← links)
- Permutations are not context-free: An application of the interchange lemma (Q1165021) (← links)
- On Abelian squares and substitutions (Q1292481) (← links)
- On uniformly repetitive semigroups (Q1328454) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- On nonrepetitive sequences (Q1394229) (← links)
- Repetitive perhaps, but certainly not boring (Q1583539) (← links)
- Maximal abelian square-free words of short length. (Q1873826) (← links)
- Non-repetitive colorings of infinite sets (Q1874373) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Chains and fixing blocks in irreducible binary sequences (Q2266018) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- Splitting necklaces and measurable colorings of the real line (Q3625532) (← links)
- Crucial Words for Abelian Powers (Q3637231) (← links)
- (Q3951572) (← links)
- Partially abelian squarefree words (Q5751950) (← links)
- On two-sided infinite fixed points of morphisms (Q5958325) (← links)