Preservation of normality by non-oblivious group selection
From MaRDI portal
Publication:2035474
DOI10.1007/S00224-020-09998-1zbMATH Open1477.68148arXiv1905.05801OpenAlexW3049171416MaRDI QIDQ2035474FDOQ2035474
Authors: Olivier Carton, Joseph Vandehey 
Publication date: 24 June 2021
Published in: Theory of Computing Systems (Search for Journal in Brave)
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.
Full work available at URL: https://arxiv.org/abs/1905.05801
Recommendations
Formal languages and automata (68Q45) Normal numbers, radix expansions, Pisot numbers, Salem numbers, good lattice points, etc. (11K16) Symbolic dynamics (37B10)
Cites Work
- Title not available (Why is that?)
- Disjointness in ergodic theory, minimal sets, and a problem in diophantine approximation
- Normal numbers and selection rules
- Finite-state dimension
- Normal numbers and finite automata
- Selection functions that do not preserve normality
- Endliche Automaten und Zufallsfolgen
- Continued fraction normality is not preserved along arithmetic progressions
- Normality and automata
- Non-trivial matrix actions preserve normality for continued fractions
- Title not available (Why is that?)
- Subsequences of normal sequences
- Title not available (Why is that?)
- Normality and two-way automata
- On the Piatetskii-Shapiro criterion of normality
- Normal numbers and computer science
- Uncanny subsequence selections that generate normal numbers
Cited In (3)
This page was built for publication: Preservation of normality by non-oblivious group selection
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2035474)
