References
- J.-P. Allouche and J. Shallit, Automatic Sequences. Theorym Applications, Generalizations, Cambridge University Press, Cambridge, 2003.
- S. Brlek, Enumeration of factors in the Thue–Morse word, First Montreal Conference on Combinatorics and Computer Science, 1987, Discrete Appl. Math. 24 (1989), 83–96.
- G. Christol, Ensembles presque periodiques k-reconnaissables, Theoret. Comput. Sci. 9(1) (1979), pp. 141–145. doi: 10.1016/0304-3975(79)90011-2
- C. Diem, On the use of expansion series for stream ciphers, LMS J. Comput. Math. 15 (2012), pp. 326–340. doi: 10.1112/S146115701200109X
- M. Drmota, C. Mauduit, and J. Rivat, Normality along squares, J. Eur. Math. Soc. (JEMS) 21 (2019), pp. 507–548. doi: 10.4171/JEMS/843
- D. Gómez-Pérez, L. Mérai, and H. Niederreiter, On the expansion complexity of sequences over finite fields, IEEE Trans. Inform. Theory 64 (2018), pp. 4228–4232. doi: 10.1109/TIT.2018.2792490
- R. Hofer, L. Mérai, and A. Winterhof, Measures of pseudorandomness: Arithmetic autocorrelation and correlation measure, Number theory-Diophantine problems, uniform distribution and applications, 303–312, Springer, Cham, 2017.
- C.J.A. Jansen, Investigations on nonlinear streamcipher systems: construction and evaluation methods, Ph.D. diss., Technical University of Delft, Delft, 1989.
- C.J.A. Jansen, The maximum order complexity of sequence ensembles, in Advances in Cryptology – EUROCRYPT '91, Lect. Notes Comput. Sci. 547, D.W. Davies, ed., Springer-Verlag, Berlin, Heidelberg, 1991, pp. 153–159.
- A. de Luca and S. Varricchio, Some combinatorial properties of the Thue–Morse sequence and a problem in semigroups, Theoret. Comput. Sci. 63 (1989), pp. 333–348. doi: 10.1016/0304-3975(89)90013-3
- 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 73 (1998), pp. 256–276. doi: 10.1006/jnth.1998.2286
- Y. Moshe, On the subword complexity of Thue–Morse polynomial extractions, Theoret. Comput. Sci. 389 (2007), pp. 318–329. doi: 10.1016/j.tcs.2007.10.015
- Z. Sun and A. Winterhof, On the maximum order complexity of the Thue–Morse and Rudin–Shapiro sequence, Preprint.
- A. Topuzoğlu and A. Winterhof, Pseudorandom Sequences. Topics in Geometry, Coding Theory and Cryptography, Algebr. Appl., Vol. 6, Springer, Dordrecht, 2007, pp. 135–166.