Fewest repetitions versus maximal-exponent powers in infinite binary words
From MaRDI portal
Publication:650894
DOI10.1016/J.TCS.2011.08.011zbMATH Open1227.68083OpenAlexW1985979067MaRDI QIDQ650894FDOQ650894
Authors: Golnaz Badkobeh 
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
Recommendations
Cites Work
- How many squares must a binary sequence contain?
- Title not available (Why is that?)
- A generator of morphisms for infinite words
- Sur un théorème de Thue
- Fewest repetitions in infinite binary words
- A proof of Dejean’s conjecture
- Title not available (Why is that?)
- Last cases of Dejean's conjecture
- Avoiding large squares in infinite binary words
- Polynomial versus exponential growth in repetition-free binary words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- A generalization of repetition threshold
Cited In (10)
- Infinite words containing the minimal number of repetitions
- Polynomial versus exponential growth in repetition-free binary words
- SIMULTANEOUS AVOIDANCE OF LARGE SQUARES AND FRACTIONAL POWERS IN INFINITE BINARY WORDS
- Counting maximal-exponent factors in words
- Fewest repetitions in infinite binary words
- Binary words with a given Diophantine exponent
- Infinite binary words containing repetitions of odd period
- On the existence of minimal \(\beta \)-powers
- On maximal repetitions of arbitrary exponent
- Characterization of some binary words with few squares
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)
