Binary words with a given Diophantine exponent
From MaRDI portal
(Redirected from Publication:1034641)
Recommendations
- Enumeration of irreducible binary words
- Parity index of binary words and powers of prime words
- Characterization of some binary words with few squares
- A stronger square conjecture on binary words
- Fewest repetitions versus maximal-exponent powers in infinite binary words
- Binary words excluding a pattern and proper Riordan arrays
- On the multiplicative complexity of binary words with a given number of units.
- The number of binary words avoiding Abelian fourth powers grows exponentially
- scientific article; zbMATH DE number 2087492
- Binary words containing infinitely many overlaps
Cites work
- scientific article; zbMATH DE number 1408353 (Why is no real title available?)
- Binary words containing infinitely many overlaps
- Diophantine properties of real numbers generated by finite automata
- Dynamics forβ-shifts and Diophantine approximation
- Every real number greater than 1 is a critical exponent
- For each \(\alpha > 2\) there is an infinite binary word with critical exponent \(\alpha \)
- Initial powers of Sturmian sequences
- On critical exponents in fixed points of non-erasing morphisms
- On extremal properties of the Fibonacci word
- On nonrepetitive sequences
- On the complexity of algebraic numbers. I: Expansions in integer bases
- On the critical exponent of generalized Thue-Morse words
- On the expansion of some exponential periods in an integer base
- Powers of a rational number modulo 1 cannot lie in a small interval
- Real numbers of sublinear complexity: irrationality and transcendence measures
- Repetitions in the Fibonacci infinite word
- Sturmian words and words with a critical exponent
- The structure of the set of cube-free \(Z\)-words in a two-letter alphabet
Cited in
(1)
This page was built for publication: Binary words with a given Diophantine exponent
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1034641)
