The following pages link to Growth problems for avoidable words (Q908709):
Displaying 31 items.
- Growth properties of power-free languages (Q465700) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Pattern avoidance on graphs (Q878624) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- Thue type problems for graphs, points, and numbers (Q941381) (← links)
- Polynomial growth in semigroup varieties. (Q952539) (← links)
- The unambiguity of segmented morphisms (Q967360) (← links)
- A cyclic binary morphism avoiding abelian fourth powers (Q1001897) (← 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)
- The set of \(k\)-power free words over \(\Sigma\) is empty or perfect (Q1399694) (← links)
- Growth, unavoidable words, and M. Sapir's conjecture for semigroup varieties. (Q1421814) (← links)
- Avoidance bases for formulas with reversal (Q1643149) (← links)
- Avoidability of formulas with two variables (Q1676792) (← links)
- Avoidability of circular formulas (Q1743715) (← links)
- Some variations on a theme of Irina Mel'nichuk concerning the avoidability of patterns in strings of symbols (Q1753110) (← links)
- On the structure and extendibility of \(k\)-power free words (Q1891362) (← links)
- Non-repetitive words: Ages and essences (Q1912750) (← links)
- Formulas with reversal (Q2011639) (← links)
- Avoidability of palindrome patterns (Q2223455) (← links)
- Characterization of some binary words with few squares (Q2348261) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Avoiding square-free words on free groups (Q2672587) (← links)
- Doubled patterns with reversal and square-free doubled patterns (Q2699639) (← links)
- Avoidability of Formulas with Two Variables (Q2817400) (← links)
- Avoiding conjugacy classes on the 5-letter alphabet (Q3298122) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- Binary words avoiding the pattern AABBCABBA (Q5190083) (← links)
