Finite-State Independence

In this work we introduce a notion of independence based on finite-state automata: two infinite words are independent if no one helps to compress the other using one-to-one finite-state transducers with auxiliary input. We prove that, as expected, the set of independent pairs of infinite words has Lebesgue measure 1. We show that the join of two independent normal words is normal. However, the independence of two normal words is not guaranteed if we just require that their join is normal. To prove this we construct a normal word x1x2x3… where x2n = xn for every n. This construction has its own interest.

[1]  Olivier Carton,et al.  Normality and automata , 2015, J. Comput. Syst. Sci..

[2]  W. Fitch.  Random sequences. , 1983, Journal of molecular biology.

[3]  David A. Huffman,et al.  A method for the construction of minimum-redundancy codes , 1952, Proceedings of the IRE.

[4]  Olivier Carton,et al.  Normality and two-way automata , 2015, Inf. Comput..

[5]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[6]  Jeffrey Shallit,et al.  Automatic Complexity of Strings , 2001, J. Autom. Lang. Comb..

[7]  Claus-Peter Schnorr,et al.  Endliche Automaten und Zufallsfolgen , 1972, Acta Informatica.

[8]  Y. Bugeaud.  Distribution Modulo One and Diophantine Approximation: References , 2012 .

[9]  Steven M. Kautz.  Degrees of random sets , 1991 .

[10]  Bjørn Kjos-Hanssen,et al.  Nondeterministic Automatic Complexity of Almost Square-Free and Strongly Cube-Free Words , 2014, COCOON.

[11]  Jack H. Lutz,et al.  Finite-State Dimension , 2001, ICALP.

[12]  Cristian S. Calude,et al.  Cdmtcs Research Report Series Algorithmically Independent Sequences Algorithmically Independent Sequences , 2022 .

[13]  Lauwerens Kuipers,et al.  Uniform distribution of sequences , 1974 .

[14]  M. Borel.  Les probabilités dénombrables et leurs applications arithmétiques , 1909 .

[15]  Verónica Becher,et al.  Normal Numbers and Computer Science , 2018 .

[16]  I. Niven,et al.  An introduction to the theory of numbers , 1961 .

[17]  Denis R. Hirschfeldt,et al.  Algorithmic randomness and complexity. Theory and Applications of Computability , 2012 .

[18]  Rodney G. Downey,et al.  Algorithmic Randomness and Complexity , 2010, Theory and Applications of Computability.

[19]  Jacques Sakarovitch,et al.  Elements of Automata Theory , 2009 .

[20]  Paul M. B. Vitányi,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 1993, Graduate Texts in Computer Science.

[21]  HENRY STEINITZ,et al.  KOLMOGOROV COMPLEXITY AND ALGORITHMIC RANDOMNESS , 2013 .

[22]  Bruno Bauwens,et al.  Conditional Probabilities and van Lambalgen’s Theorem Revisited , 2016, Theory of Computing Systems.

[23]  Verónica Becher,et al.  Normal numbers and finite automata , 2013, Theor. Comput. Sci..

[24]  E. T..  An Introduction to the Theory of Numbers , 1946, Nature.

[25]  A. Nies.  Computability and randomness , 2009 .