The following pages link to Avoidable patterns on two letters (Q1114419):
Displaying 17 items.
- Decision algorithms for Fibonacci-automatic words. II: Related sequences and avoidability (Q346252) (← links)
- Strict bounds for pattern avoidance (Q393106) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- Unavoidable binary patterns (Q1323331) (← links)
- Unary patterns under permutations (Q1659986) (← links)
- Avoidability of formulas with two variables (Q1676792) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- On long words avoiding Zimin patterns (Q2321925) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Avoiding letter patterns in ternary square-free words (Q2635082) (← links)
- Avoiding patterns in the abelian sense (Q2762708) (← links)
- Pattern avoidability with involution (Q2789515) (← links)