Fewest repetitions versus maximal-exponent powers in infinite binary words
From MaRDI portal
(Redirected from Publication:650894)
Recommendations
Cites work
- scientific article; zbMATH DE number 5605093 (Why is no real title available?)
- scientific article; zbMATH DE number 1024080 (Why is no real title available?)
- A generator of morphisms for infinite words
- A proof of Dejean’s conjecture
- Avoiding large squares in infinite binary words
- Fewest repetitions in infinite binary words
- How many squares must a binary sequence contain?
- Last cases of Dejean's conjecture
- Polynomial versus exponential growth in repetition-free binary words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- Sur un théorème de Thue
Cited in
(11)- Binary words with a given Diophantine exponent
- On maximal repetitions of arbitrary exponent
- Infinite words containing the minimal number of repetitions
- Characterization of some binary words with few squares
- On the existence of minimal \(\beta \)-powers
- Counting maximal-exponent factors in words
- Antisquares and critical exponents
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- Polynomial versus exponential growth in repetition-free binary words
- Fewest repetitions in infinite binary words
- Infinite binary words containing repetitions of odd period
This page was built for publication: Fewest repetitions versus maximal-exponent powers in infinite binary words
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q650894)
