On the Maximum Order Complexity of Thue–Morse and Rudin–Shapiro Sequences along Polynomial Values

Pubblicato online: 25 dic 2020

Pagine: 9 - 22

Ricevuto: 17 giu 2020

Accettato: 24 giu 2020

DOI: https://doi.org/10.2478/udt-2020-0008

Parole chiave

Automatic sequences, pseudorandomness, Thue–Morse sequence, Rudin–Shapiro sequence, polynomials

© 2020 Pierre Popoli, published by Sciendo

This work is licensed under the Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International License.