Pages that link to "Item:Q2381499"
From MaRDI portal
The following pages link to Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499):
Displaying 21 items.
- Unavoidable regularities in long words with bounded number of symbol occurrences (Q386431) (← links)
- Strict bounds for pattern avoidance (Q393106) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Grasshopper avoidance of patterns (Q727190) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- Finite automata and pattern avoidance in words (Q1775550) (← links)
- Words restricted by patterns with at most 2 distinct letters (Q1856065) (← links)
- Doubled patterns with reversal are 3-avoidable (Q2140468) (← links)
- Another approach to non-repetitive colorings of graphs of bounded degree (Q2195220) (← links)
- Lower-bounds on the growth of power-free languages over large alphabets (Q2230725) (← links)
- Repetition avoidance in products of factors (Q2272409) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Doubled patterns with reversal and square-free doubled patterns (Q2699639) (← links)
- Highly nonrepetitive sequences: Winning strategies from the local lemma (Q3068764) (← links)
- A short proof that shuffle squares are 7-avoidable (Q3186679) (← links)
- On avoidance of patterns of the form {\sigma}-{\tau} by words over a finite alphabet (Q3455038) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- Density dichotomy in random words (Q4634993) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- How far away must forced letters be so that squares are still avoidable? (Q5118863) (← links)
