Preservation of normality by unambiguous transducers

We consider finite state non-deterministic but unambiguous transducers with infinite inputs and infinite outputs, and we consider the property of Borel normality of sequences of symbols. When these transducers are strongly connected, and when the input is a Borel normal sequence, the output is a sequence in which every block has a frequency given by a weighted automaton over the rationals. We provide an algorithm that decides in cubic time whether a unambiguous transducer preserves normality.

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

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

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

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

[5]  Symbolic dynamics , 2008, Scholarpedia.

[6]  Christian Choffrut,et al.  Uniformization of Rational Relations , 1999, Jewels are Forever.

[7]  John Odentrantz,et al.  Markov Chains: Gibbs Fields, Monte Carlo Simulation, and Queues , 2000, Technometrics.

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

[9]  Ronald L. Rivest,et al.  Introduction to Algorithms, third edition , 2009 .

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

[11]  Valerie Isham,et al.  Non‐Negative Matrices and Markov Chains , 1983 .

[12]  J. Sakarovitch.  Rational and Recognisable Power Series , 2009 .

[13]  Olivier Carton,et al.  Preservation of normality by transducers , 2019, ArXiv.

[14]  Maxime Crochemore,et al.  Détermination de la Représentation Standard d'une Série Reconnaissable , 1980, RAIRO Theor. Informatics Appl..

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

[16]  D. Champernowne.  The Construction of Decimals Normal in the Scale of Ten , 1933 .