From Randomness in Two Symbols to Randomness in Three Symbols

[1]AGAFONOV, V. N.: Normal sequences and finite automata. (English. Russian original) Zbl 0242.94040 Sov. Math., Dokl. 9 (1968), 324–325. (Translation from Dokl. Akad. Nauk SSSR 179, 255-256 (1968)).Search in Google Scholar

[2]BECHER, V.—CARTON, O.: Normal Numbers and Computer Science. In: (Valérie Berthéand Michel Rigó, ed.) Sequences, groups, and number theory, Trends in Mathematics Series. Birkhauser/Springer, Cham, 2018. pp. 233–269.10.1007/978-3-319-69152-7_7Search in Google Scholar

[3]BOREL, É.: Les probabilités dénombrables et leurs applications arithmétiques, Rend. Circ. Mat. Palermo 27 (1909), no. 1. 247–271.10.1007/BF03019651Search in Google Scholar

[4]BUGEAUD, Y.: Distribution Modulo One and Diophantine Approximation. In: Cambridge Tracts in Mathematics Vol. 193, Cambridge University Press, Cambrdge, 2012.10.1017/CBO9781139017732Search in Google Scholar

[5]CHAMPERNOWNE, D.: The Construction of Decimals Normal in the Scale of Ten. J. London Math. Soc. 8 (1933), no. 4, 254–260.10.1112/jlms/s1-8.4.254Search in Google Scholar

[6]ROGERS, H. JR.: Theory of recursive functions and effective computability (second edition). MIT Press, Cambridge, MA, 1987.Search in Google Scholar

[7]KAMAE, T.—WEISS, B.: Normal numbers and selection rules, Israel J. Math. 21 (1975), no. 2, 101–110.10.1007/BF02760789Search in Google Scholar

[8]PIATETSKI-SHAPIRO, I. I.: On the law of distribution of the fractional parts of the exponential function, Izv. Akad. Nauk SSSR Ser. Mat. 15 (1951), no. 1, 47–52.Search in Google Scholar

[9]VANDEHEY, J.: Uncanny subsequence selections that generate normal numbers, Unif. Distrib. Theory 12 (2018), no. 2, 65–75.10.1515/udt-2017-0015Search in Google Scholar

[10]BESICOVITCH, A. S.: The asymptotic distribution of the numerals in the decimal representation of the squares of the natural numbers, Math. Z. 39 (1935), no. 1, 146–156.10.1007/BF01201350Search in Google Scholar