Pages that link to "Item:Q1838047"
From MaRDI portal
The following pages link to Uniformly growing k-th power-free homomorphisms (Q1838047):
Displaying 50 items.
- Initial non-repetitive complexity of infinite words (Q284845) (← links)
- A ternary square-free sequence avoiding factors equivalent to \(abcacba\) (Q289989) (← links)
- On \(k\)-abelian avoidability (Q376138) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Square-free words with square-free self-shuffles (Q405075) (← links)
- Square-free words obtained from prefixes by permutations (Q418771) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Square-free shuffles of words (Q496046) (← links)
- Relations on words (Q505060) (← links)
- Bounds for the generalized repetition threshold (Q544880) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- The number of binary words avoiding Abelian fourth powers grows exponentially (Q596075) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- Growth of power-free languages: numerical and asymptotic bounds (Q610578) (← links)
- Problems in between words and abelian words: \(k\)-abelian avoidability (Q714821) (← links)
- A propos d'une conjecture de F. Dejean sur les répétitions dans les mots (Q792102) (← links)
- On the centers of the set of weakly square-free words on a two letter alphabet (Q800095) (← links)
- On regularity of languages generated by copying systems (Q800098) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Dejean's conjecture and Sturmian words (Q872047) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- Growth problems for avoidable words (Q908709) (← links)
- There are \(k\)-uniform cubefree binary morphisms for all \(k \geq 0\) (Q967293) (← links)
- The entropy of square-free words (Q967942) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Every real number greater than 1 is a critical exponent (Q995572) (← links)
- On intermediate factorial languages (Q1028151) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Total palindrome complexity of finite words (Q1045150) (← links)
- Repetition-free words (Q1078338) (← links)
- Systèmes codés. (Coded systems) (Q1081313) (← links)
- Multidimensional unrepetitive configurations (Q1106022) (← links)
- Enumeration of irreducible binary words (Q1121031) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Some results on \(k\)-power-free morphisms (Q1605332) (← links)
- Growth of power-free languages over large alphabets (Q1678750) (← links)
- On cube-free \(\omega\)-words generated by binary morphisms (Q1835915) (← links)
- Some non finitely generated monoids of repetition-free endomorphisms. (Q1853181) (← links)
- Actions of small cancellation groups on hyperbolic spaces (Q2025662) (← links)
- Computing the maximum exponent in a stream (Q2118207) (← links)
- Counting ternary square-free words quickly (Q2140467) (← links)
- On shuffling of infinite square-free words (Q2260629) (← links)
- Dejean's conjecture holds for \(n\geq 30\) (Q2271427) (← links)
- On the least number of palindromes in two-dimensional words (Q2286748) (← links)
- Some further results on squarefree arithmetic progressions in infinite words (Q2333815) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- Circular repetition thresholds on some small alphabets: last cases of Gorbunova's conjecture (Q2420559) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Freeness of partial words (Q2465643) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
