Pages that link to "Item:Q1292490"

The following pages link to On repetition-free binary words of minimal density (Q1292490):

Displaying 21 items.

• Growth properties of power-free languages (Q465700) (← links)
• Pattern avoidance: themes and variations (Q557911) (← links)
• Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
• Minimum degree and density of binary sequences (Q709264) (← links)
• On the entropy and letter frequencies of powerfree words (Q845374) (← links)
• Avoiding fractional powers over the natural numbers (Q1753115) (← 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)
• On the tree of binary cube-free words (Q2408811) (← links)
• Optimal bounds for the similarity density of the Thue-Morse word with overlap-free and \(\frac73\)-power-free infinite binary words (Q2800416) (← links)
• Minimal Discriminating Words Problem Revisited (Q2856588) (← links)
• On repetition-free binary words of minimal density (extended abstract) (Q4218146) (← links)
• (Q4483933) (← links)
• Avoiding or Limiting Regularities in Words (Q4613549) (← links)
• Infinite words containing squares at every position (Q5190080) (← links)
• The minimal density of a letter in an infinite ternary square-free word is 883/3215 (Q5387509) (← links)
• On highly repetitive and power free words (Q5404287) (← links)
• WORDS AVOIDING $\frac{7}{3}$-POWERS AND THE THUE–MORSE MORPHISM (Q5462674) (← links)
• Dejean's conjecture and letter frequency (Q5899396) (← links)
• Dejean's conjecture and letter frequency (Q5900364) (← links)