Binary words with a given Diophantine exponent
From MaRDI portal
Publication:1034641
DOI10.1016/j.tcs.2009.08.013zbMath1194.68181OpenAlexW1965656515MaRDI QIDQ1034641
Publication date: 6 November 2009
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2009.08.013
Related Items
Cites Work
- Unnamed Item
- Binary words containing infinitely many overlaps
- On critical exponents in fixed points of non-erasing morphisms
- Every real number greater than 1 is a critical exponent
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
- On nonrepetitive sequences
- Sturmian words and words with a critical exponent
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the expansion of some exponential periods in an integer base
- The structure of the set of cube-free $ Z$-words in a two-letter alphabet
- Nombres réels de complexité sous-linéaire : mesures d'irrationalité et de transcendance
- Diophantine properties of real numbers generated by finite automata
- Initial powers of Sturmian sequences
- On extremal properties of the Fibonacci word
- Powers of a rational number modulo 1 cannot lie in a small interval
- Repetitions in the Fibonacci infinite word
- On the critical exponent of generalized Thue-Morse words
- Dynamics forβ-shifts and Diophantine approximation
