Preservation of normality by non-oblivious group selection

05/03/2019
by   Olivier Carton, et al.
0

We give two different proofs of the fact that non-oblivious selection via regular group sets preserves normality. Non-oblivious here means that whether or not a symbol is selected can depend on the symbol itself. One proof relies on the incompressibility of normal sequences, the other on the use of augmented dynamical systems.

READ FULL TEXT
research
08/14/2023

Ergodic Estimations for Toeplitz Sequences Generated by a Symbol

We analyse the convergence of the ergodic formula for Toeplitz matrix-se...
research
03/21/2002

Entropy estimation of symbol sequences

We discuss algorithms for estimating the Shannon entropy h of finite sym...
research
06/19/2020

Robustness of Pisot-regular sequences

We consider numeration systems based on a d-tuple 𝐔=(U_1,…,U_d) of seque...
research
09/05/2018

Some results relating Kolmogorov complexity and entropy of amenable group actions

It was proved by Brudno that entropy and Kolmgorov complexity for dynami...
research
01/26/2018

Symbol Emergence in Cognitive Developmental Systems: a Survey

Symbol emergence through a robot's own interactive exploration of the wo...
research
08/30/2010

Prediction by Compression

It is well known that text compression can be achieved by predicting the...
research
08/01/2006

On a solution to display non-filled-in quaternionic Julia sets

During early 1980s, the so-called `escape time' method, developed to dis...

Please sign up or login with your details

Forgot password? Click here to reset