Finding automatic sequences with few correlations

References

[1] J.-P. Allouche, On a Golay-Shapiro-like sequence, Unif. Distrib. Theory, 11 (2016) 205–210.
Search in Google Scholar Back to article
[2] J.-P. Allouche and J. Shallit, Automatic sequences, Cambridge University Press, Cambridge, 2003. Theory, applications, generalizations.10.1017/CBO9780511546563
Search in Google Scholar Back to article
[3] E. Grant, J. Shallit and T. Stoll, Bounds for the discrete correlation of infinite sequences on k symbols and generalized Rudin-Shapiro sequences, Acta Arith., 140 (2009) 345–368.
Search in Google Scholar Back to article
[4] I. Marcovici, T. Stoll and P.-A. Tahay, Discrete correlations of order 2 of generalized Golay-Shapiro sequences: a combinatorial approach, Integers, 21 (2021), #A44.
Search in Google Scholar Back to article
[5] M. Queffélec, Une nouvelle propriété des suites de Rudin-Shapiro, Ann. Inst. Fourier (Grenoble), 37 (1987) 115–138.
Search in Google Scholar Back to article
[6] P.-A. Tahay, Discrete correlation of order 2 of generalized Rudin-Shapiro sequences on alphabets of arbitrary size, Unif. Distrib. Theory, 15 (2020) 1–26.
Search in Google Scholar Back to article