Automatic forcing and genericity: On the diagonalization strength of finite automata, Discrete mathematics and theoretical computer science. 4th international conference, pp.97-108, 2003. ,
Normality and automata, J. Comput. Syst. Sci, vol.81, issue.8, pp.1592-1613, 2015. ,
Normal numbers and finite automata, Theor. Comput. Sci, vol.477, pp.109-116, 2013. ,
Entropy rates and finite-state dimension. Theor, Comput. Sci, vol.349, issue.3, pp.392-406, 2005. ,
Information and randomness, Texts in Theoretical Computer Science. An EATCS Series, 2002. ,
Finite-state dimension, Theor. Comput. Sci, vol.310, issue.1-3, pp.1-33, 2004. ,
Finite-state dimension and real arithmetic, Inf. Comput, vol.205, issue.11, pp.1640-1651, 2007. ,
Finite-state dimension and lossy decompressors, 2006. ,
Algorithmic Randomness and Complexity. Theory and Applications of Computability, 2010. ,
An introduction to Kolmogorov complexity and its applications. Texts and Monographs in Computer Science, 1993. ,
The definition of random sequences, Inf. Control, vol.9, pp.602-619, 1966. ,
On the values for factor complexity, to appear 13. Nies, A.: Computability and randomness, Oxford Logic Guides, vol.51, 2009. ,
Measure and category, Graduate Texts in Mathematics, vol.2, 1980. ,
Infinite words. Automata, semigroups, logic and games. Amsterdam, 2004. ,
URL : https://hal.archives-ouvertes.fr/hal-00620767
Eine algorithmische Begründung der Wahrscheinlichkeitstheorie, Lecture Notes in Mathematics, vol.218, 1971. ,
Endliche Automaten und Zufallsfolgen, Acta Inf, vol.1, pp.345-359, 1972. ,
On compression with two-way head machines, Proceedings of the IEEE Data Compression Conference, DCC, pp.218-227, 1991. ,
On encoding and decoding with two-way head machines, Inf. Comput, vol.116, issue.1, pp.128-133, 1995. ,
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
Reguläre Nullmengen, Elektron. Informationsverarbeit. Kybernetik, vol.12, issue.6, pp.307-311, 1976. ,
Kolmogorov complexity and Hausdorff dimension, Inform. and Comput, vol.103, issue.2, pp.159-194, 1993. ,
, Handbook of Formal Languages, vol.3, pp.339-387, 1997.
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. ,
Phase transition and strong predictability, Unconventional computation and natural computation. 13th international conference, pp.340-352, 2014. ,
, Complexity and randomness. Rend. Semin. Mat., Torino, vol.62, issue.1, pp.1-37, 2004.
Automata on infinite objects, Handbook of theoretical computer science, vol.B, pp.133-191, 1990. ,
behavior and synthesis, Finite automata, vol.1, 1973. ,
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
Defining fairness in reactive and concurrent systems, J. ACM, vol.59, issue.3, p.37, 2012. ,