See also the paper of V.N. Agafonov with the same name in the collection: Problemy Kibernetiki (Cybernetics problems), Doklady AN SSSR, vol.179, pp.123-129, 1968. ,
Turing's normal numbers: towards randomness, How the World Computes, Proceedings of the Turing Centenary Conference and the 8th Conference in Computability in, vol.7318, pp.35-45, 2012. ,
Finite-state independence, 2016. ,
Normal number and finite automata, Theoretical Computer Science, vol.477, pp.109-116, 2013. ,
Transductions and Context-Free Languages Vieweg+Teubner Verlag, 1969. ,
The asymptotic distribution of the numerals in the decimal representation of the squares of the natural numbers, Mathematische Zeitschrift, vol.39, issue.1, pp.146-156, 1935. ,
On the history of martingales in the study of randomness, Electronic Journ@l for History of Probability and Statistics, vol.5, issue.1, pp.1-40, 2009. ,
, Les probabilités dénombrables et leur applications arithmétiques, Rendiconti del Circolo Matematico di Palermo, vol.27, pp.247-271, 2009.
Entropy rates and finite-state dimension, Theoretical Computer Science, vol.349, issue.3, pp.392-406, 2005. ,
Distribution modulo one and Diophantine approximation, Cambridge Tracts in Mathematics, vol.193, 2012. ,
, Finite state complexity, vol.412, pp.5668-5677, 2011.
Finite state incompressible infinite sequences, Information and Computation, vol.247, pp.23-36, 2016. ,
On a paper of Niven and Zuckerman, Pacific Journal of Mathematics, vol.2, issue.4, pp.555-557 ,
The construction of decimals normal in the scale of ten, Journal of the London Mathematical Society, pp.254-260, 1933. ,
Note on normal numbers, Bulletin of the American Mathematical Society, vol.52, issue.10, pp.857-860, 1946. ,
Finitestate dimension, Theoretical Computer Science, vol.310, pp.1-33, 2004. ,
Satyadev Nandakumar, Finite-state dimension and real arithmetic, Information and Computation, vol.205, issue.11, pp.1640-1651, 2007. ,
, Algorithmic randomness and complexity, 2010.
Note on Normal Decimals, Canadian Journal of Mathematics, vol.4, pp.58-63, 1952. ,
Nondeterministic complexity of overlap-free and almost square-free words, The Electronic Journal of Combinatorics, vol.22, p.3, 2015. ,
Two Characterizations for Finite-State Dimension, Fundamentals of Computation Theory, 22nd International Symposium, pp.80-94, 2019. ,
Uniform distribution of sequences, 1974. ,
An Introduction to Kolmogorov complexity and its applications, vol.792, 1993. ,
Dimension in complexity classes, Preliminary version appeared in Proc. 15th IEEE Conference on Computational Complexity, vol.32, pp.158-169, 2000. ,
A Kolmogorov complexity characterization of constructive Hausdorff dimension, Information Processing Letters, vol.84, pp.1-3, 2002. ,
A short proof of Pillai's theorem of normal numbers, Pacific Journal of Mathematics, vol.2, issue.1, pp.23-24, 1952. ,
Computability and randomness, Oxford Logic Guides, vol.435, 2009. ,
The Mathematical Association of America, pp.94-116, 1956. ,
On the definition of normal numbers, Pacific Journal of Mathematics, vol.1, issue.1, pp.103-109, 1951. ,
On the laws of distribution of the fractional parts of an exponential function [Russian: ?. ?. ????????-??????, ? ??????? ????????????? ??????? ????? ????????????? ???????, Izvestia Akademii Nauk SSSR, Ser. Matem, vol.15, issue.1, pp.47-52, 1951. ,
On the distribution of the fractional parts of an exponential function [Russian: ?. ?. ????????-??????, ? ????????????? ??????? ????? ????????????? ???????, Uchenye Zapiski Moskovskogo Gosudarstvennogo Pedagogicheskogo Instituta, vol.108, pp.317-322, 1957. ,
On normal numbers, Proceedings of the Indian Academy of Sciences, Section A, vol.10, issue.1, pp.13-15, 1939. ,
On normal numbers, Proceedings of the Indian Academy of Sciences, Section A, vol.12, issue.2, pp.179-184, 1940. ,
On the question of distribution of fractional parts of the exponential function [Russian: ?. ?. ?????????, ? ??????? ? ????????????? ??????? ????? ????????????? ???????, Doklady AN SSSR, issue.3, pp.473-476, 1952. ,
Bernouilli-normal sequences of symbols [Russian: ?????????? ?? ???????? ?????????????????? ??????, Izvestia AN SSSR, Seriya matematicheskaya, vol.21, issue.4, pp.501-514, 1957. ,
A unified approach to the definition of random sequences, Mathematical Systems Theory (now Theory of Computing Systems), vol.5, pp.246-258, 1971. ,
, Acta Informatica, vol.1, issue.4, pp.345-384, 1972.
Automatic complexity of strings, Journal of Automata, Languages and Combinatorics, vol.6, pp.4-537, 2001. ,
Around Kolmogorov complexity: basic notions and results. Measures of Complexity. Festschrift for Alexey Chervonenkis, pp.75-116, 2015. ,
URL : https://hal.archives-ouvertes.fr/lirmm-01233758
, Kolmogorov complexity and algorithmic randomness, 2013.
URL : https://hal.archives-ouvertes.fr/lirmm-00786255
, Automatic Kolmogorov Complexity and Normality Revisited
Automatic Kolmogorov Complexity and Normality Revisited, Fundamentals of Computation Theory, Lecture Notes in Computer Science, vol.10472, pp.418-430, 2017. ,
Relations between varieties of Kolmogorov complexities, Mathematical Systems Theory, vol.29, pp.271-292, 1996. ,
Étude critique de la notion de collectif, 1939. ,
Normal numbers, Thesis, 1949. ,
On the valuedness of finite transducers, Acta Informatica, vol.27, issue.8, pp.749-780, 1990. ,
Über dir Gleichverteilung von Zahlen mod, Eins, Mathematische Annalen, vol.77, issue.3, pp.313-352, 1916. ,