Pages that link to "Item:Q598459"
From MaRDI portal
The following pages link to Polynomial versus exponential growth in repetition-free binary words (Q598459):
Displaying 25 items.
- Infinite words containing the minimal number of repetitions (Q396642) (← links)
- Minimal critical exponent of quasiperiodic words (Q401485) (← links)
- Deciding context equivalence of binary overlap-free words in linear time (Q444679) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Relations on words (Q505060) (← links)
- Pattern avoidance: themes and variations (Q557911) (← links)
- Avoiding large squares in infinite binary words (Q557912) (← links)
- Fewest repetitions versus maximal-exponent powers in infinite binary words (Q650894) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- On the entropy and letter frequencies of powerfree words (Q845374) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- On maximal repetitions of arbitrary exponent (Q991771) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- The critical exponent functions (Q2131735) (← links)
- On the number of \(\alpha \)-power-free binary words for \(2<\alpha \leq 7/3\) (Q2271420) (← links)
- Subword complexity and power avoidance (Q2326389) (← links)
- Letter frequency in infinite repetition-free words (Q2373761) (← links)
- Exponential lower bounds for the number of words of uniform length avoiding a pattern (Q2381499) (← links)
- On Dejean's conjecture over large alphabets (Q2456366) (← links)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Fewest repetitions in infinite binary words (Q2911423) (← links)
- A generator of morphisms for infinite words (Q3421905) (← links)
- Lengths of extremal square-free ternary words. (Q4986268) (← links)
- Infinite words containing squares at every position (Q5190080) (← links)
- Interview with Jeffrey Shallit (Q6098018) (← links)
