Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
437972 | Theoretical Computer Science | 2009 | 5 Pages |
Abstract
We prove that every real number ξ≥1 is the Diophantine exponent of some binary word ω. More precisely, we show that Dio(ω)=ξ for ω=10k110k210k3⋯, where kn=[ξn] for ξ≥2,kn=[νn] with for 1<ξ<2, and kn=n for ξ=1.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics