Pages that link to "Item:Q1162827"
From MaRDI portal
The following pages link to Sharp characterizations of squarefree morphisms (Q1162827):
Displaying 40 items.
- Primitive morphisms (Q293147) (← links)
- Infinite ternary square-free words concatenated from permutations of a single word (Q390906) (← links)
- Square-free words obtained from prefixes by permutations (Q418771) (← links)
- Square-free shuffles of words (Q496046) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- A powerful abelian square-free substitution over 4 letters (Q837181) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Nonrepetitive colorings of trees (Q864157) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- The entropy of square-free words (Q967942) (← links)
- On the product of square-free words (Q1060021) (← links)
- A characterization of power-free morphisms (Q1062467) (← links)
- Square-free words on partially commutative free monoids (Q1076163) (← links)
- Repetition-free words (Q1078338) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- On square-free arithmetic progressions in infinite words (Q1740699) (← links)
- Some non finitely generated monoids of repetition-free endomorphisms. (Q1853181) (← links)
- Overlap-free morphisms and finite test-sets (Q1887045) (← links)
- Disposability in square-free words (Q1998870) (← links)
- Binary codes that do not preserve primitivity (Q2104527) (← links)
- Lengths of irreducible and delicate words (Q2153402) (← links)
- Periodicity, repetitions, and orbits of an automatic sequence (Q2271417) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Existence of finite test-sets for \(k\)-power-freeness of uniform morphisms (Q2381820) (← links)
- Prefix-primitivity-preserving homomorphisms (Q2469977) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- A test-set for<i>k</i>-power-free binary morphisms (Q3149084) (← links)
- Reduction in non-(<i>k</i>+ 1)-power-free morphisms (Q3186671) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- A uniform cube-free morphism is<i>k</i>-power-free for all integers<i>k</i>≥ 4 (Q4638265) (← links)
- Abelian squares are avoidable on 4 letters (Q5204304) (← links)
- (Q5212139) (← links)
- Estimates in Shirshov height theorem (Q5239608) (← links)
- Binary codes that do not preserve primitivity (Q6111526) (← links)
- On the number of partially abelian square-free words on a three-letter alphabet (Q6390604) (← links)
- Power-free complementary binary morphisms (Q6565999) (← links)
