Fewest repetitions versus maximal-exponent powers in infinite binary words
From MaRDI portal
Publication:650894
DOI10.1016/j.tcs.2011.08.011zbMath1227.68083OpenAlexW1985979067MaRDI QIDQ650894
Publication date: 7 December 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2011.08.011
Related Items (2)
Infinite binary words containing repetitions of odd period ⋮ Characterization of some binary words with few squares
Cites Work
- Unnamed Item
- Unnamed Item
- Last cases of Dejean's conjecture
- Avoiding large squares in infinite binary words
- Polynomial versus exponential growth in repetition-free binary words
- How many squares must a binary sequence contain?
- Sur un théorème de Thue
- A generalization of repetition threshold
- Fewest repetitions in infinite binary words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- A proof of Dejean’s conjecture
- A generator of morphisms for infinite words
This page was built for publication: Fewest repetitions versus maximal-exponent powers in infinite binary words
