Automatic Kolmogorov complexity and normality revisited

Alexander Shen 1
1 ESCAPE - Systèmes complexes, automates et pavages
LIRMM - Laboratoire d'Informatique de Robotique et de Microélectronique de Montpellier
Abstract : It is well known that normality (all factors of given length appear in an infinite sequence with the same frequency) can be described as incompressibility via finite automata. Still the statement and proof of this result as given by Becher and Heiber [4] in terms of " lossless finite-state compressors " do not follow the standard scheme of Kolmogorov complexity definition (the automaton is used for compression, not decompression). We modify this approach to make it more similar to the traditional Kolmogorov complexity theory (and simpler) by explicitly defining the notion of automatic Kolmogorov complexity and using its simple properties. Other known notions (Shallit–Wang [9], Calude–Salomaa–Roblot [5]) of description complexity related to finite automata are discussed (see the last section). As a byproduct, we obtain simple proofs of classical results about normality (equivalence of definitions with aligned occurences and all occurencies, Wall's theorem saying that a normal number remains normal when multiplied by a rational number, and Agafonov's result saying that normality is preserved by automatic selection rules).
Type de document :
Autre publication
Arxiv preprint; submitted. 2017
Liste complète des métadonnées

Littérature citée [11 références]  Voir  Masquer  Télécharger
Contributeur : Alexander Shen <>
Soumis le : jeudi 9 mars 2017 - 20:50:49
Dernière modification le : jeudi 11 janvier 2018 - 06:27:05




Alexander Shen. Automatic Kolmogorov complexity and normality revisited. Arxiv preprint; submitted. 2017. 〈lirmm-01486488〉



Consultations de la notice