{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:44:15Z","timestamp":1776822255332,"version":"3.51.2"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031975479","type":"print"},{"value":"9783031975486","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2025]]},"DOI":"10.1007\/978-3-031-97548-6_18","type":"book-chapter","created":{"date-parts":[[2025,6,29]],"date-time":"2025-06-29T10:48:50Z","timestamp":1751194130000},"page":"205-216","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Purely Automatic Sequences with\u00a0the\u00a0Uniform Distribution Property"],"prefix":"10.1007","author":[{"given":"Shuo","family":"Li","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7489-0980","authenticated-orcid":false,"given":"Narad","family":"Rampersad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2025,6,30]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","unstructured":"Avgustinovich, S.V., Fon-Der-Flaass, D.G., Frid, A.E.: Arithmetical Complexity of Infinite Words, pp. 51\u201362 (2003)","DOI":"10.1142\/9789812704979_0004"},{"key":"18_CR2","unstructured":"Byszewski, J., Konieczny, J., M\u00fcllner, C.: Gowers norms for automatic sequences. Discrete Anal. (2023)"},{"key":"18_CR3","unstructured":"Boyd, D.W., Janice\u00a0Cook, P.M.: On sequences of $$\\pm $$1\u2019s defined by binary patterns. Instytut Matematyczny Polskiej Akademi Nauk (1989). http:\/\/eudml.org\/doc\/268620"},{"key":"18_CR4","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1016\/j.tcs.2017.01.009","volume":"668","author":"FM Dekking","year":"2017","unstructured":"Dekking, F.M., Keane, M.S.: On the conjugacy class of the fibonacci dynamical system. Theor. Comput. Sci. 668, 59\u201369 (2017)","journal-title":"Theor. Comput. Sci."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Drmota, M., Mauduit, C., Rivat, J.: The sum-of-digits function of polynomial sequences. J. Lond. Math. Soc. 84(1), 81\u2013102 (2011)","DOI":"10.1112\/jlms\/jdr003"},{"key":"18_CR6","first-page":"167","volume-title":"Graph Theory and Theoretical Physics","author":"AL Dulmage","year":"1967","unstructured":"Dulmage, A.L., Mendelsohn, N.S.: Graphs and matrices. In: Harary, F. (ed.) Graph Theory and Theoretical Physics, pp. 167\u2013227. Academic, London (1967)"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Fan, A., Konieczny, J.: On uniformity of $$q$$-multiplicative sequences. Bull. London Math. Soc. (2019)","DOI":"10.1112\/blms.12245"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Gelfond, A.: Sur les nombres qui ont des propri\u00e9t\u00e9s additives et multiplicatives donn\u00e9es. Acta Arithmetica 13(3), 259\u2013265 (1968). http:\/\/eudml.org\/doc\/204828","DOI":"10.4064\/aa-13-3-259-265"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, 2 edn. (2012)","DOI":"10.1017\/CBO9781139020411"},{"issue":"2","key":"18_CR10","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1006\/jnth.1998.2327","volume":"74","author":"DH Kim","year":"1999","unstructured":"Kim, D.H.: On the joint distribution of q-additive functions in residue classes. J. Number Theory 74(2), 307\u2013336 (1999)","journal-title":"J. Number Theory"},{"issue":"4","key":"18_CR11","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.5802\/aif.3285","volume":"69","author":"J Konieczny","year":"2019","unstructured":"Konieczny, J.: Gowers norms for the Thue-Morse and Rudin-Shapiro sequences. Annales de l\u2019Institut Fourier 69(4), 1897\u20131913 (2019)","journal-title":"Annales de l\u2019Institut Fourier"},{"key":"18_CR12","unstructured":"Konieczny, J., M\u00fcllner, C.: Arithmetical subword complexity of automatic sequences (2023). https:\/\/hal.science\/hal-04201450"},{"issue":"1","key":"18_CR13","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1007\/s11511-009-0040-0","volume":"203","author":"C Mauduit","year":"2009","unstructured":"Mauduit, C., Rivat, J.: La somme des chiffres des carr\u00e9s. Acta Math. 203(1), 107\u2013148 (2009)","journal-title":"Acta Math."},{"key":"18_CR14","doi-asserted-by":"crossref","unstructured":"Mauduit, C., Rivat, J.: Sur un probl\u00e8me de Gelfond: la somme des chiffres des nombres premiers. Ann. Math. (2) 171(3), 1591\u20131646 (2010)","DOI":"10.4007\/annals.2010.171.1591"},{"issue":"10","key":"18_CR15","doi-asserted-by":"publisher","first-page":"2595","DOI":"10.4171\/jems\/566","volume":"17","author":"C Mauduit","year":"2015","unstructured":"Mauduit, C., Rivat, J.: Prime numbers along Rudin-Shapiro sequences. J. Eur. Math. Soc. (JEMS) 17(10), 2595\u20132642 (2015)","journal-title":"J. Eur. Math. Soc. (JEMS)"},{"issue":"11","key":"18_CR16","doi-asserted-by":"publisher","first-page":"7899","DOI":"10.1090\/tran\/7210","volume":"370","author":"C Mauduit","year":"2018","unstructured":"Mauduit, C., Rivat, J.: Rudin-Shapiro sequences along squares. Trans. Amer. Math. Soc. 370(11), 7899\u20137921 (2018)","journal-title":"Trans. Amer. Math. Soc."},{"issue":"5","key":"18_CR17","doi-asserted-by":"publisher","first-page":"1096","DOI":"10.4153\/CJM-2017-053-1","volume":"70","author":"C M\u00fcllner","year":"2018","unstructured":"M\u00fcllner, C.: The Rudin-Shapiro sequence and similar sequences are normal along squares. Canad. J. Math. 70(5), 1096\u20131129 (2018)","journal-title":"Canad. J. Math."},{"issue":"1","key":"18_CR18","doi-asserted-by":"publisher","first-page":"283","DOI":"10.1016\/S0304-3975(01)00228-6","volume":"292","author":"P S\u00e9\u00e9bold","year":"2003","unstructured":"S\u00e9\u00e9bold, P.: On some generalizations of the Thue-Morse morphism. Theor. Comput. Sci. 292(1), 283\u2013298 (2003)","journal-title":"Theor. Comput. Sci."},{"issue":"12","key":"18_CR19","doi-asserted-by":"publisher","first-page":"2560","DOI":"10.1112\/S0010437X20007563","volume":"156","author":"L Spiegelhofer","year":"2020","unstructured":"Spiegelhofer, L.: The level of distribution of the Thue-Morse sequence. Compos. Math. 156(12), 2560\u20132587 (2020)","journal-title":"Compos. Math."}],"container-title":["Lecture Notes in Computer Science","Combinatorics on Words"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-97548-6_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T01:20:51Z","timestamp":1776820851000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-97548-6_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031975479","9783031975486"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-97548-6_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"30 June 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WORDS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorics on Words","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nancy","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 June 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 July 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cwords2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/words2025.loria.fr\/en\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}