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

Data publikacji: 25 gru 2020

Zakres stron: 9 - 22

Otrzymano: 17 cze 2020

Przyjęty: 24 cze 2020

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

Słowa kluczowe

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.