2000 character limit reached
Preservation of normality by non-oblivious group selection
Published 3 May 2019 in cs.FL, cs.LO, and math.CO | (1905.05801v1)
Abstract: 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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.
