J. Allouche and J. Shallit, Automatic Sequences: Theory, Applications, Generalizations, 2003.

N. Alon, Y. Kohayakawa, C. Mauduit, C. G. Moreira, and V. Rödl, Measures of pseudorandomness for finite sequences: typical values, Proc. Lond. Math. Soc, issue.3, pp.778-812, 2007.

G. , Ensembles presque periodiques k-reconnaissables, Theoret. Comput. Sci, vol.9, issue.1, pp.141-145, 1979.

C. Diem, On the use of expansion series for stream ciphers, LMS J. Comput. Math, vol.15, pp.326-340, 2012.

M. Drmota, C. Mauduit, and J. Rivat, The sum-of-digits function of polynomial sequences, J. Lond. Math. Soc, vol.6, issue.2, pp.507-548, 2011.
URL : https://hal.archives-ouvertes.fr/hal-01260110

C. Mauduit and J. Rivat, Rudin-Shapiro sequences along squares, Transactions of the American Mathematical Society, vol.370, issue.11, pp.7899-7921, 2018.
URL : https://hal.archives-ouvertes.fr/hal-02075857

C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences. II. The Champernowne, Rudin-Shapiro, and Thue-Morse sequences, a further construction, J. Number Theory, vol.73, issue.2, pp.256-276, 1998.
URL : https://hal.archives-ouvertes.fr/hal-02529811

C. Mauduit and A. Sárközy, On finite pseudorandom binary sequences. I. Measure of pseudorandomness, the Legendre symbol, Acta Arith, vol.82, issue.4, pp.365-377, 1997.
URL : https://hal.archives-ouvertes.fr/hal-02529811

L. Mérai and A. Winterhof, On the pseudorandomness of automatic sequences, Cryptogr. Commun, vol.10, issue.6, pp.1013-1022, 2018.

Y. Moshe, On the subword complexity of Thue-Morse polynomial extractions, Theoret. Comput. Sci, vol.389, issue.1-2, pp.318-329, 2007.

C. Müllner, The Rudin-Shapiro sequence and similar sequences are normal along squares, Canad. J. Math, vol.70, issue.5, pp.1096-1129, 2018.

Z. Sun and A. Winterhof, On the maximum order complexity of subsequences of the Thue-Morse and Rudin-Shapiro sequence along squares, Int. J. Comput. Math. Comput. Syst. Theory, vol.14, issue.2, pp.30-36, 2019.