Randomness Criterion Σ and Its Applications

Abstract

The Sigma function, which is the sum of the squares of the number of occurrences of every factor, is a criterion of randomness, measuring specially the uniformity of the block distribution. An infinite word whose prefixes attain asymptotically the smallest possible value of it is called Sigma-random. We prove that the Champernowne word is Sigma-random. We also consider less complex words which have values with asymptotically larger order, Sturmian words and almost 0-words.