Pages that link to "Item:Q3421905"
From MaRDI portal
The following pages link to A generator of morphisms for infinite words (Q3421905):
Displayed 14 items.
- Strict bounds for pattern avoidance (Q393106) (← links)
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Computing the partial word avoidability indices of ternary patterns (Q396699) (← links)
- Application of entropy compression in pattern avoidance (Q405191) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Avoiding large squares in partial words (Q551207) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- Infinite binary words containing repetitions of odd period (Q2339599) (← links)
- Characterization of some binary words with few squares (Q2348261) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Doubled patterns are 3-avoidable (Q2635083) (← links)
- Avoidability of Formulas with Two Variables (Q2817400) (← links)
- Repetition thresholds for subdivided graphs and trees (Q2911431) (← links)
- Binary words avoiding the pattern AABBCABBA (Q5190083) (← links)