The following pages link to (Q3689370):
Displaying 36 items.
- Deciding context equivalence of binary overlap-free words in linear time (Q444679) (← links)
- Growth properties of power-free languages (Q465700) (← links)
- Polynomial versus exponential growth in repetition-free binary words (Q598459) (← links)
- On the number of Dejean words over alphabets of 5, 6, 7, 8, 9 and 10 letters (Q650879) (← links)
- Overlap-free words and spectra of matrices (Q837157) (← links)
- On the context-freeness of the set of words containing overlaps (Q845966) (← links)
- Growth rate of binary words avoiding \(xxx^{R}\) (Q897919) (← links)
- Growth rates of complexity of power-free languages (Q986556) (← links)
- Overlap-freeness in infinite partial words (Q1006076) (← links)
- Growth rates of power-free languages (Q1037095) (← links)
- Repetition-free words (Q1078338) (← links)
- On the length of word chains (Q1108812) (← links)
- Some combinatorial properties of the Thue-Morse sequence and a problem in semigroups (Q1119694) (← links)
- Overlap-free words and finite automata (Q1261466) (← links)
- Periodicity and the golden ratio (Q1275466) (← links)
- A characterization of overlap-free morphisms (Q1308744) (← links)
- On the number of Abelian square-free words on four letters (Q1382260) (← links)
- Extremal overlap-free and extremal \(\beta\)-free binary words (Q2215463) (← 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)
- Growth of repetition-free words -- a review (Q2484440) (← links)
- Overlap-free symmetric D0L words (Q2768453) (← links)
- On patterns occurring in binary algebraic numbers (Q3522307) (← links)
- Two-Sided Bounds for the Growth Rates of Power-Free Languages (Q3637248) (← links)
- A linear-time algorithm to decide whether a binary word contains an overlap (Q3789095) (← links)
- On approximations of words by words without self-overlapping (Q3970810) (← links)
- Repetitions in the Fibonacci infinite word (Q4012668) (← links)
- Algèbres effectives dans la programmation logique avec contraintes (Q4012670) (← links)
- If a DOL language is k-power free then it is circular (Q4630287) (← links)
- The Number of Threshold Words on $n$ Letters Grows Exponentially for Every $n\geq 27$ (Q5109538) (← links)
- The repetition threshold for binary rich words (Q5130737) (← links)
- Infinite words containing squares at every position (Q5190080) (← links)
- Computing the Growth of the Number of Overlap-Free Words with Spectra of Matrices (Q5458519) (← links)
- Symbol Separation in Double Occurrence Words (Q5859654) (← links)
- Construction of a bi-infinite power free word with a given factor and a non-recurrent letter (Q6175097) (← links)
- The first-order theory of binary overlap-free words is decidable (Q6622783) (← links)
