Subword complexity and finite characteristic numbers
Publisher
Cellule MathDoc/CEDRAM
Reference22 articles.
1. [1] B. Adamczewski & Y. Bugeaud, On the complexity of algebraic numbers I. Expansions in integer bases, Annals of Mathematics 165 (2007), 547–565.
2. [2] B. Adamczewski & Y. Bugeaud & F. Luca, Sur la complexité des nombres algébriques. C. R. Math. Acad. Sci. Paris, 339(2004), 11-14.
3. [3] J.-P. Allouche, Sur la transcendance de la série formelle Π, Journal de Théorie des Nombres de Bordeaux 2 (1990), 103–117.
4. [4] J.-P. Allouche & J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
5. [5] David H. Bailey, Peter B. Borwein and Simon Plouffe, On the Rapid Computation of Various Polylogarithmic Constants, Mathematics of Computation, vol. 66, no. 218 (1997), pg. 903?-913.