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

Published Online: Dec 25, 2020

Page range: 9 - 22

Received: Jun 17, 2020

Accepted: Jun 24, 2020

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

Keywords

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.