Automatic Kolmogorov Complexity and Normality Revisited - LIRMM - Laboratoire d’Informatique, de Robotique et de Microélectronique de Montpellier Access content directly
Conference Papers Year : 2017

Automatic Kolmogorov Complexity and Normality Revisited

Alexander Shen

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).

Dates and versions

lirmm-01803449 , version 1 (30-05-2018)

Identifiers

Cite

Alexander Shen. Automatic Kolmogorov Complexity and Normality Revisited. FTC: Fundamentals of Computation Theory, Dec 2017, Bordeaux, France. pp.418-430, ⟨10.1007/978-3-662-55751-8_33⟩. ⟨lirmm-01803449⟩
284 View
0 Download

Altmetric

Share

Gmail Mastodon Facebook X LinkedIn More