K. Ambos-spies and E. Busse, Automatic forcing and genericity: On the diagonalization strength of finite automata, Discrete mathematics and theoretical computer science. 4th international conference, pp.97-108, 2003.

V. Becher, O. Carton, and P. A. Heiber, Normality and automata, J. Comput. Syst. Sci, vol.81, issue.8, pp.1592-1613, 2015.

V. Becher and P. A. Heiber, Normal numbers and finite automata, Theor. Comput. Sci, vol.477, pp.109-116, 2013.

C. Bourke, J. M. Hitchcock, and N. Vinodchandran, Entropy rates and finite-state dimension. Theor, Comput. Sci, vol.349, issue.3, pp.392-406, 2005.

C. S. Calude, Information and randomness, Texts in Theoretical Computer Science. An EATCS Series, 2002.

J. J. Dai, J. I. Lathrop, J. H. Lutz, and E. Mayordomo, Finite-state dimension, Theor. Comput. Sci, vol.310, issue.1-3, pp.1-33, 2004.

D. Doty, J. H. Lutz, and S. Nandakumar, Finite-state dimension and real arithmetic, Inf. Comput, vol.205, issue.11, pp.1640-1651, 2007.

D. Doty and P. Moser, Finite-state dimension and lossy decompressors, 2006.

R. G. Downey and D. R. Hirschfeldt, Algorithmic Randomness and Complexity. Theory and Applications of Computability, 2010.

M. Li and P. M. Vitányi, An introduction to Kolmogorov complexity and its applications. Texts and Monographs in Computer Science, 1993.

P. Martin-löf, The definition of random sequences, Inf. Control, vol.9, pp.602-619, 1966.

B. Moldagaliyev, L. Staiger, and F. Stephan, On the values for factor complexity, to appear 13. Nies, A.: Computability and randomness, Oxford Logic Guides, vol.51, 2009.

J. C. Oxtoby, Measure and category, Graduate Texts in Mathematics, vol.2, 1980.

D. Perrin and J. E. Pin, Infinite words. Automata, semigroups, logic and games. Amsterdam, 2004.
URL : https://hal.archives-ouvertes.fr/hal-00620767

C. P. Schnorr, Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, Lecture Notes in Mathematics, vol.218, 1971.

C. P. Schnorr and H. Stimm, Endliche Automaten und Zufallsfolgen, Acta Inf, vol.1, pp.345-359, 1972.

D. Sheinwald, A. Lempel, and J. Ziv, On compression with two-way head machines, Proceedings of the IEEE Data Compression Conference, DCC, pp.218-227, 1991.

D. Sheinwald, A. Lempel, and J. Ziv, On encoding and decoding with two-way head machines, Inf. Comput, vol.116, issue.1, pp.128-133, 1995.

A. Shen, Automatic Kolmogorov complexity and normality revisited, Fundamentals of Computation Theory-21st International Symposium, vol.10472, pp.418-430, 2017.
URL : https://hal.archives-ouvertes.fr/lirmm-01803449

L. Staiger, Reguläre Nullmengen, Elektron. Informationsverarbeit. Kybernetik, vol.12, issue.6, pp.307-311, 1976.

L. Staiger, Kolmogorov complexity and Hausdorff dimension, Inform. and Comput, vol.103, issue.2, pp.159-194, 1993.

L. Staiger, Handbook of Formal Languages, vol.3, pp.339-387, 1997.

L. Staiger, Rich ?-words and monadic second-order arithmetic, BFb0028032, selected papers from the 11th International Workshop (CSL '97) held at the 6th Annual Conference of the European Association for, vol.1414, pp.478-490, 1997.

K. Tadaki, Phase transition and strong predictability, Unconventional computation and natural computation. 13th international conference, pp.340-352, 2014.

S. A. Terwijn, Complexity and randomness. Rend. Semin. Mat., Torino, vol.62, issue.1, pp.1-37, 2004.

W. Thomas, Automata on infinite objects, Handbook of theoretical computer science, vol.B, pp.133-191, 1990.

B. A. Trakhtenbrot and Y. M. Barzdi?, behavior and synthesis, Finite automata, vol.1, 1973.

D. Varacca and H. Völzer, Temporal logics and model checking for fairly correct systems, 21th IEEE Symposium on Logic in Computer Science (LICS 2006, pp.389-398, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00148934

H. Völzer and D. Varacca, Defining fairness in reactive and concurrent systems, J. ACM, vol.59, issue.3, p.37, 2012.