On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
From MaRDI portal
Publication:2129347
DOI10.2478/udt-2020-0008zbMath1498.11031arXiv2011.03457OpenAlexW3120380919MaRDI QIDQ2129347
Publication date: 22 April 2022
Published in: Uniform Distribution Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/2011.03457
Related Items (2)
Maximum order complexity of the sum of digits function in Zeckendorf base and polynomial subsequences ⋮ Pseudorandom sequences derived from automatic sequences
Cites Work
- Ensembles presque périodiques \(k\)-reconnaissables. (Almost periodic \(k\)-recognizable sets)
- On finite pseudorandom binary sequences. II: The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction
- On the pseudorandomness of automatic sequences
- Normality along squares
- On the subword complexity of Thue-Morse polynomial extractions
- On finite pseudorandom binary sequences I: Measure of pseudorandomness, the Legendre symbol
- Automatic Sequences
- The Rudin–Shapiro Sequence and Similar Sequences Are Normal Along Squares
- Rudin–Shapiro sequences along squares
- On the Maximum Order Complexity of the Thue-Morse and Rudin-Shapiro Sequence
- On the use of expansion series for stream ciphers
- The sum-of-digits function of polynomial sequences
- Measures of pseudorandomness for finite sequences: typical values
This page was built for publication: On the maximum order complexity of Thue-Morse and Rudin-Shapiro sequences along polynomial values
