The following pages link to BLOCKING SETS OF TERMS (Q3734729):
Displaying 50 items.
- Avoidability index for binary patterns with reversal (Q252854) (← links)
- Computing the partial word avoidability indices of binary patterns (Q396698) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← 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)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Avoidable binary patterns in partial words (Q766156) (← links)
- The origins of combinatorics on words (Q872058) (← links)
- On abelian 2-avoidable binary patterns (Q877171) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- A cyclic binary morphism avoiding abelian fourth powers (Q1001897) (← links)
- Long unavoidable patterns (Q1101241) (← links)
- Avoidable patterns on two letters (Q1114419) (← links)
- Every binary pattern of length six is avoidable on the two-letter alphabet (Q1186515) (← links)
- On repetition-free binary words of minimal density (Q1292490) (← links)
- Unavoidable binary patterns (Q1323331) (← links)
- Avoidance bases for formulas with reversal (Q1643149) (← links)
- Avoidability of formulas with two variables (Q1676792) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- Patterns in words and languages (Q1765231) (← links)
- Maximal abelian square-free words of short length. (Q1873826) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Words strongly avoiding fractional powers (Q1970068) (← links)
- Formulas with reversal (Q2011639) (← links)
- The complexity of unavoidable word patterns (Q2158299) (← links)
- Pattern avoidance by palindromes (Q2271438) (← links)
- On long words avoiding Zimin patterns (Q2321925) (← links)
- On the aperiodic avoidability of binary patterns with variables and reversals (Q2358690) (← links)
- Long binary patterns are abelian 2-avoidable (Q2378523) (← links)
- Searching for Zimin patterns (Q2512657) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Avoidability of Formulas with Two Variables (Q2817400) (← links)
- Computing Depths of Patterns (Q2953688) (← links)
- Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
- Avoiding conjugacy classes on the 5-letter alphabet (Q3298122) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- From Bi-ideals to Periodicity (Q3526412) (← links)
- Avoiding or Limiting Regularities in Words (Q4613549) (← links)
- On avoidability of formulas with reversal (Q4638263) (← links)
- ALGORITHMIC COMBINATORICS ON PARTIAL WORDS (Q4923275) (← links)
- Square-free extensions of words (Q5154718) (← links)
- Binary words avoiding the pattern AABBCABBA (Q5190083) (← links)
- Estimates in Shirshov height theorem (Q5239608) (← links)
- On combinatorial properties of the Arshon sequence (Q5954090) (← links)
- Abelian combinatorics on words: a survey (Q6101322) (← links)
- The lexicographically least binary rich word achieving the repetition threshold (Q6671609) (← links)
