K. B. Athreya, J. M. Hitchcock, J. H. Lutz, and E. Mayordomo, Effective Strong Dimension in Algorithmic Information and Computational Complexity, Proceedings of the 21st Annual Symposium on Theoretical Aspects of Computer Science, pp.632-643, 2004.
DOI : 10.1137/S0097539703446912

M. Béal, M. Crochemore, F. Mignosi, A. Restivo, and M. Sciortino, Computing forbidden words of regular languages, Fundamenta Informaticae, vol.56, issue.12, pp.121-135, 2003.

M. Béal, F. Mignosi, A. Restivo, and M. Sciortino, Forbidden Words in Symbolic Dynamics, Advances in Applied Mathematics, vol.25, issue.2, pp.163-193, 2000.
DOI : 10.1006/aama.2000.0682

M. Béal and D. Perrin, Symbolic Dynamics and Finite Automata, Handbook of Formal Languages, 1997.
DOI : 10.1007/978-3-662-07675-0_10

J. H. Davenport, Y. Siret, and E. Tournier, Computer Algebra, 1993.
DOI : 10.1002/3527600434.eap728
URL : https://hal.archives-ouvertes.fr/inria-00072643

J. Delvenne and V. D. Blondel, Quasi-periodic configurations and undecidable dynamics for tilings, infinite words and Turing machines, Theoretical Computer Science, vol.319, issue.1-3, pp.127-143, 2004.
DOI : 10.1016/j.tcs.2004.02.018

G. Hansel, D. Perrin, and I. Simon, Compression and entropy, Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science (STACS '92), pp.515-528, 1992.
DOI : 10.1007/3-540-55210-3_209

L. Hurd, J. Kari, and K. Culik, The topological entropy of cellular automata is uncomputable. Ergodic Theory and Dynamical Systems, pp.255-265, 1992.

K. Ko, Complexity Theory of Real Functions, Progress in Theoretical Computer Science. Birkhäuser, 1991.
DOI : 10.1007/978-1-4684-6802-1

K. Ko, On the computability of fractal dimensions and Hausdorff measure, Annals of Pure and Applied Logic, vol.93, issue.1-3, pp.1-3195, 1998.
DOI : 10.1016/S0168-0072(97)00060-2

P. Koiran, The topological entropy of iterated piecewise affine maps is uncomputable, Discrete Mathematics and Theoretical Computer Science, vol.4, issue.2, pp.351-356, 2001.
URL : https://hal.archives-ouvertes.fr/hal-00958966

D. Lind and B. Marcus, An Introduction to Symbolic Dynamics and Coding, 1995.
DOI : 10.1017/CBO9780511626302

B. Mishra, Algorithmic Algebra. Texts and Monographs in Computer Science, 1993.

H. and R. Jr, Theory of Recursive Functions and Effective Computability, 1987.

L. Staiger, Kolmogorov Complexity and Hausdorff Dimension, Information and Computation, vol.103, issue.2, pp.159-194, 1993.
DOI : 10.1006/inco.1993.1017

L. Staiger, A Tight Upper Bound on Kolmogorov Complexity and Uniformly Optimal Prediction, Theory of Computing Systems, vol.31, issue.3, pp.215-229, 1998.
DOI : 10.1007/s002240000086

A. Turing, On computable numbers with an application to the " entscheidungsproblem, Proceedings of the London Mathematical Society, pp.230-265, 1936.

P. Walters, An Introduction to Ergodic Theory, Graduate Texts in Mathematics, vol.79, 1981.
DOI : 10.1007/978-1-4612-5775-2

K. Weihrauch, Computable Analysis: An Introduction, 1998.

M. Ziegler and V. Brattka, Computability in linear algebra, Theoretical Computer Science, vol.326, issue.1-3, pp.187-211, 2004.
DOI : 10.1016/j.tcs.2004.06.022