B. Adamczewski, On the expansion of some exponential periods in an integer base, Mathematische Annalen, vol.11, issue.1, pp.107-116, 2010.
DOI : 10.1007/s00208-009-0391-z
URL : https://hal.archives-ouvertes.fr/hal-00863633

B. Adamczewski and Y. Bugeaud, On the complexity of algebraic numbers, II. Continued fractions, Acta Mathematica, vol.195, issue.1, pp.1-20, 2005.
DOI : 10.1007/BF02588048
URL : https://hal.archives-ouvertes.fr/hal-00014575

B. Adamczewski and Y. Bugeaud, On the complexity of algebraic numbers I. Expansions in integer bases, Annals of Mathematics, vol.165, issue.2, pp.547-565, 2007.
DOI : 10.4007/annals.2007.165.547

B. Adamczewski and Y. Bugeaud, Dynamics for ??-shifts and Diophantine approximation, Ergodic Theory and Dynamical Systems, vol.10, issue.06, pp.1695-1710, 2007.
DOI : 10.1112/blms/12.4.269

B. Adamczewski and Y. Bugeaud, Mesures de transcendance et aspects quantitatifs de la m??thode de Thue-Siegel-Roth-Schmidt, Proc. London Math, pp.1-31, 2010.
DOI : 10.1112/plms/pdp054

B. Adamczewski and Y. Bugeaud, Nombres r??els de complexit?? sous-lin??aire : mesures d'irrationalit?? et de transcendance, Journal f??r die reine und angewandte Mathematik (Crelles Journal), vol.2011, issue.658, pp.65-98, 2011.
DOI : 10.1515/crelle.2011.061

B. Adamczewski and Y. Bugeaud, Trancendence measure for continued fractions involving repetitive or symmetric patterns, J. Eur. Math. Soc, vol.12, pp.883-914, 2010.
URL : https://hal.archives-ouvertes.fr/hal-00863630

B. Adamczewski, Y. Bugeaud, and F. Luca, Sur la complexit?? des nombres alg??briques, Comptes Rendus Mathematique, vol.339, issue.1, pp.11-14, 2004.
DOI : 10.1016/j.crma.2004.04.012

B. Adamczewski and J. Cassaigne, Diophantine properties of real numbers generated by finite automata, Compositio Mathematica, vol.142, issue.06, pp.1351-1372, 2006.
DOI : 10.1112/S0010437X06002247
URL : https://hal.archives-ouvertes.fr/hal-00017758

B. Adamczewski and C. Faverjon, Méthode de Mahler : relations linéaires, transcendance et applications aux nombres automatiques, prétirage 2015

J. Albert, Propriétés combinatoires et arithmétiques de certaines suites automatiques et substitutives, 2006.

J. Allouche and J. Shallit, Automatic sequences. Theory, applications, generalizations, 2003.

J. Autebert, J. Berstel, and L. Boasson, Context-Free Languages and Pushdown Automata, Handbook of formal languages, pp.111-174, 1997.
DOI : 10.1007/978-3-642-59136-5_3
URL : https://hal.archives-ouvertes.fr/hal-00620669

J. Berstel and L. Boasson, Modèles de machines, in Encyclopédie de l'informatique et des systèmes d'information, pp.987-998, 2006.

D. Bertrand, Theta functions and transcendence, The Ramanujan Journal, vol.1, issue.4, pp.339-350, 1997.
DOI : 10.1023/A:1009749608672

´. E. Borel, Les probabilit??s d??nombrables et leurs applications arithm??tiques, Rendiconti del Circolo Matematico di Palermo, vol.XXXIII, issue.1, pp.247-271, 1909.
DOI : 10.1007/BF03019651

J. M. Borwein and P. B. Borwein, On the complexity of familiar functions and numbers, SIAM Rev, pp.589-601, 1988.

Y. Bugeaud, An explicit lower bound for the block complexity of an algebraic number, Rendiconti Lincei - Matematica e Applicazioni, vol.19, issue.9, pp.229-235, 2008.
DOI : 10.4171/RLM/521

Y. Bugeaud, Automatic continued fractions are transcendental or quadratic, Annales scientifiques de l'??cole normale sup??rieure, vol.46, issue.6, pp.1005-1022, 2013.
DOI : 10.24033/asens.2208

J. Cassaigne and F. Nicolas, Factor complexity, in Combinatorics, automata and number theory, Encyclopedia Math, Appl, vol.135, pp.163-247, 2010.

D. Caucal and M. L. Gonidec, Context-free automatic sequences, Procceding of Theoretical Aspects of Computing -ICTAC 2014, pp.259-276, 2014.

N. Chomsky, Three models for the description of language, IEEE Transactions on Information Theory, vol.2, issue.3, pp.113-124, 1956.
DOI : 10.1109/TIT.1956.1056813

A. Cobham, Functional equations for register machines, Proccedings of the Hawaii International Conference on System Sciences, 1968.

A. Cobham, A proof of transcendence based on functional equations, RC?2041, IBM Research Center, Yorktown Heights, 1968.

A. Cobham, On the hartmanis-stearns problem for a class of tag machines, 9th Annual Symposium on Switching and Automata Theory (swat 1968), pp.51-60, 1968.
DOI : 10.1109/SWAT.1968.20

A. Cobham, Uniform tag sequences, Mathematical Systems Theory, vol.5, issue.1-2, pp.164-192, 1972.
DOI : 10.1007/BF01706087

D. Duverney, . Ke, . Nishioka, . Ku, I. Nishioka et al., Transcendence of Jacobi's theta series, Proc. Japan Acad. Sci, pp.72-202, 1996.
DOI : 10.3792/pjaa.72.202

J. Hartmanis and R. E. Stearns, On the computational complexity of algorithms, Transactions of the American Mathematical Society, vol.117, pp.285-306, 1965.
DOI : 10.1090/S0002-9947-1965-0170805-7

J. E. Hopcroft, R. Motawi, and J. D. Ullman, Introduction to automata theory, languages, and computation, 2006.

M. and L. Gonidec, Drunken man infinite words complexity, RAIRO -Theoret, Inf. and Appl, vol.42, pp.599-613, 2008.

M. and L. Gonidec, On the complexity of a family of k-context-free sequences, Theoret . Comp. Sci, vol.44, pp.47-54, 2012.
URL : https://hal.archives-ouvertes.fr/hal-01186148

K. Mahler, Zur Approximation der Exponentialfunktionen und des Logarithmus. I, II, J. reine angew, Math, vol.166, pp.118-150, 1932.

M. L. Minsky, Computation: finite and infinite machines, Prentice-Hall Series in Automatic Computation, 1967.

M. Morse and G. A. Hedlund, Symbolic Dynamics, American Journal of Mathematics, vol.60, issue.4, pp.815-866, 1938.
DOI : 10.2307/2371264

Y. Moshe, On some questions regarding k -regular and k -context-free sequences, Theoretical Computer Science, vol.400, issue.1-3, pp.62-69, 2008.
DOI : 10.1016/j.tcs.2008.02.018

Y. V. Nesterenko, Modular functions and transcendence questions, Matematicheskii Sbornik, vol.187, issue.9, pp.65-96, 1996.
DOI : 10.4213/sm158

J. Pansiot, Complexit?? des facteurs des mots infinis engendr??s par morphismes it??r??s, Lecture Notes in Comput. Sci, vol.172, pp.380-389, 1984.
DOI : 10.1007/3-540-13345-3_34

N. and P. Fogg, Substitutions in dynamics, arithmetics and combinatorics, Lecture Notes in Math, vol.1794, 2002.
DOI : 10.1007/b13861

M. Queffélec, Substitution dynamical systems?spectral analysis (second edition), Lecture Notes in Math, 2010.

M. Sipser, Introduction to the Theory of Computation, ACM SIGACT News, vol.27, issue.1, 2012.
DOI : 10.1145/230514.571645

A. M. Turing, On computable numbers, with an application to the Entscheidungsproblem, Proc. London Math. Soc, vol.42, pp.230-265, 1937.