Recommendations
Cites work
- A proof of Dejean’s conjecture
- Bounds for the generalized repetition threshold
- Complementary symmetric Rote sequences: the critical exponent and the recurrence function
- Critical exponents of infinite balanced words
- Decidability for Sturmian words
- Decision algorithms for Fibonacci-automatic words. I: Basic results.
- Extremal overlap-free and extremal -free binary words
- Finite-repetition threshold for infinite ternary words
- Last cases of Dejean's conjecture
- New results on pseudosquare avoidance
- On Abelian repetition threshold
- Polynomial versus exponential growth in repetition-free binary words
- Repetition avoidance in circular factors
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- Special factors, periodicity, and an application to Sturmian words
- Sur un théorème de Thue
- The repetition threshold for binary rich words
- Unary patterns with permutations
- Words and forbidden factors
Cited in
(3)
This page was built for publication: Antisquares and critical exponents
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6599795)
