{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:28:34Z","timestamp":1759638514259,"version":"3.40.3"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031206238"},{"type":"electronic","value":"9783031206245"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20624-5_26","type":"book-chapter","created":{"date-parts":[[2022,10,28]],"date-time":"2022-10-28T15:18:05Z","timestamp":1666970285000},"page":"426-442","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["String Attractors and\u00a0Infinite Words"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-1972-6931","authenticated-orcid":false,"given":"Antonio","family":"Restivo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-3489-0684","authenticated-orcid":false,"given":"Giuseppe","family":"Romana","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-6928-0168","authenticated-orcid":false,"given":"Marinella","family":"Sciortino","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2022,10,29]]},"reference":[{"key":"26_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications","author":"JP Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications. Cambridge University Press, Generalizations (2003)"},{"key":"26_CR2","doi-asserted-by":"crossref","unstructured":"B\u00e9al, M., Perrin, D., Restivo, A.: Decidable problems in substitution shifts. CoRR abs\/2112.14499 (2021)","DOI":"10.2139\/ssrn.4057954"},{"key":"26_CR3","unstructured":"Cassaigne, J.: Sequences with grouped factors. In: Developments in Language Theory, pp. 211\u2013222. Aristotle University of Thessaloniki (1997)"},{"issue":"5","key":"26_CR4","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1006\/eujc.1996.0110","volume":"18","author":"J Cassaigne","year":"1997","unstructured":"Cassaigne, J., Karhum\u00e4ki, J.: Toeplitz words, generalized periodicity and periodically iterated morphisms. Eur. J. Comb. 18(5), 497\u2013510 (1997)","journal-title":"Eur. J. Comb."},{"issue":"43","key":"26_CR5","doi-asserted-by":"publisher","first-page":"4372","DOI":"10.1016\/j.tcs.2009.07.018","volume":"410","author":"G Castiglione","year":"2009","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Circular Sturmian words and Hopcroft\u2019s algorithm. Theor. Comput. Sci. 410(43), 4372\u20134381 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"38\u201339","key":"26_CR6","doi-asserted-by":"publisher","first-page":"3414","DOI":"10.1016\/j.tcs.2010.05.025","volume":"411","author":"G Castiglione","year":"2010","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: On extremal cases of Hopcroft\u2019s algorithm. Theor. Comput. Sci. 411(38\u201339), 3414\u20133422 (2010)","journal-title":"Theor. Comput. Sci."},{"key":"26_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1007\/978-3-540-88282-4_17","volume-title":"Language and Automata Theory and Applications","author":"G Castiglione","year":"2008","unstructured":"Castiglione, G., Restivo, A., Sciortino, M.: Hopcroft\u2019s algorithm and cyclic automata. In: Mart\u00edn-Vide, C., Otto, F., Fernau, H. (eds.) LATA 2008. LNCS, vol. 5196, pp. 172\u2013183. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-88282-4_17"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"8:1","DOI":"10.1145\/3426473","volume":"17","author":"AR Christiansen","year":"2021","unstructured":"Christiansen, A.R., Ettienne, M.B., Kociumaka, T., Navarro, G., Prezza, N.: Optimal-time dictionary-compressed indexes. ACM Trans. Algorithms 17(1), 8:1-8:39 (2021)","journal-title":"ACM Trans. Algorithms"},{"issue":"2","key":"26_CR9","doi-asserted-by":"publisher","first-page":"466","DOI":"10.1137\/050646846","volume":"21","author":"S Constantinescu","year":"2007","unstructured":"Constantinescu, S., Ilie, L.: The Lempel-Ziv complexity of fixed points of morphisms. SIAM J. Discret. Math. 21(2), 466\u2013481 (2007)","journal-title":"SIAM J. Discret. Math."},{"issue":"2","key":"26_CR10","doi-asserted-by":"publisher","first-page":"766","DOI":"10.1016\/j.jmaa.2005.09.004","volume":"321","author":"D Damanik","year":"2006","unstructured":"Damanik, D., Lenz, D.: Substitution dynamical systems: characterization of linear repetitivity and applications. J. Math. Anal. Appl. 321(2), 766\u2013780 (2006)","journal-title":"J. Math. Anal. Appl."},{"key":"26_CR11","doi-asserted-by":"crossref","unstructured":"Durand, F., Perrin, D.: Dimension Groups and Dynamical Systems: Substitutions, Bratteli Diagrams and Cantor Systems. Cambridge Studies in Advanced Mathematics, Cambridge University Press (2022)","DOI":"10.1017\/9781108976039"},{"key":"26_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/978-3-031-05578-2_11","volume-title":"Developments in Language Theory","author":"A Frosini","year":"2022","unstructured":"Frosini, A., Mancini, I., Rinaldi, S., Romana, G., Sciortino, M.: Logarithmic equal-letter runs for BWT of purely morphic words. In: Diekert, V., Volkov, M. (eds.) Developments in Language Theory. Lecture Notes in Computer Science, vol. 13257, pp. 139\u2013151. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-05578-2_11"},{"key":"26_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.5802\/jtnb.438","volume":"16","author":"A Heinis","year":"2004","unstructured":"Heinis, A.: Languages under substitutions and balanced words. Journal de Th\u00e9orie des Nombres de Bordeaux 16, 151\u2013172 (2004)","journal-title":"Journal de Th\u00e9orie des Nombres de Bordeaux"},{"key":"26_CR14","doi-asserted-by":"crossref","unstructured":"Kempa, D., Prezza, N.: At the roots of dictionary compression: string attractors. In: STOC 2018, pp. 827\u2013840. ACM (2018)","DOI":"10.1145\/3188745.3188814"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D Knuth","year":"1977","unstructured":"Knuth, D., Morris, J., Pratt, V.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"26_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1007\/978-3-030-61792-9_17","volume-title":"LATIN 2020: Theoretical Informatics","author":"T Kociumaka","year":"2020","unstructured":"Kociumaka, T., Navarro, G., Prezza, N.: Towards a definitive measure of repetitiveness. In: Kohayakawa, Y., Miyazawa, F.K. (eds.) LATIN 2021. LNCS, vol. 12118, pp. 207\u2013219. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-61792-9_17"},{"key":"26_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"213","DOI":"10.1007\/978-3-030-59212-7_15","volume-title":"String Processing and Information Retrieval","author":"K Kutsukake","year":"2020","unstructured":"Kutsukake, K., Matsumoto, T., Nakashima, Y., Inenaga, S., Bannai, H., Takeda, M.: On repetitiveness measures of Thue-Morse words. In: Boucher, C., Thankachan, S.V. (eds.) SPIRE 2020. LNCS, vol. 12303, pp. 213\u2013220. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-59212-7_15"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"22","author":"A Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE T. Inform. Theory 22(1), 75\u201381 (1976)","journal-title":"IEEE T. Inform. Theory"},{"key":"26_CR19","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"26_CR20","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1016\/S0020-0190(02)00512-4","volume":"86","author":"S Mantaci","year":"2003","unstructured":"Mantaci, S., Restivo, A., Sciortino, M.: Burrows-Wheeler transform and Sturmian words. Inform. Process. Lett. 86, 241\u2013246 (2003)","journal-title":"Inform. Process. Lett."},{"key":"26_CR21","doi-asserted-by":"publisher","first-page":"236","DOI":"10.1016\/j.tcs.2020.11.006","volume":"850","author":"S Mantaci","year":"2021","unstructured":"Mantaci, S., Restivo, A., Romana, G., Rosone, G., Sciortino, M.: A combinatorial view on string attractors. Theor. Comput. Sci. 850, 236\u2013248 (2021)","journal-title":"Theor. Comput. Sci."},{"issue":"2","key":"26_CR22","first-page":"29:1","volume":"54","author":"G Navarro","year":"2021","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part I: repetitiveness measures. ACM Comput. Surv. 54(2), 29:1-29:31 (2021)","journal-title":"ACM Comput. Surv."},{"issue":"2","key":"26_CR23","first-page":"26:1","volume":"54","author":"G Navarro","year":"2021","unstructured":"Navarro, G.: Indexing highly repetitive string collections, part II: compressed indexes. ACM Comput. Surv. 54(2), 26:1-26:32 (2021)","journal-title":"ACM Comput. Surv."},{"issue":"6","key":"26_CR24","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/3531443","volume":"65","author":"G Navarro","year":"2022","unstructured":"Navarro, G.: The compression power of the BWT: technical perspective. Commun. ACM 65(6), 90 (2022)","journal-title":"Commun. ACM"},{"key":"26_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"380","DOI":"10.1007\/3-540-13345-3_34","volume-title":"Automata, Languages and Programming","author":"J-J Pansiot","year":"1984","unstructured":"Pansiot, J.-J.: Complexit\u00e9 des facteurs des mots infinis engendr\u00e9s par morphismes it\u00e9r\u00e9s. In: Paredaens, J. (ed.) ICALP 1984. LNCS, vol. 172, pp. 380\u2013389. Springer, Heidelberg (1984). https:\/\/doi.org\/10.1007\/3-540-13345-3_34"},{"key":"26_CR26","unstructured":"Schaeffer, L., Shallit, J.: String attractors for automatic sequences. CoRR abs\/2012.06840 (2021)"},{"key":"26_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/978-3-540-73208-2_36","volume-title":"Developments in Language Theory","author":"M Sciortino","year":"2007","unstructured":"Sciortino, M., Zamboni, L.Q.: Suffix automata and standard Sturmian words. In: Harju, T., Karhum\u00e4ki, J., Lepist\u00f6, A. (eds.) DLT 2007. LNCS, vol. 4588, pp. 382\u2013398. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73208-2_36"}],"container-title":["Lecture Notes in Computer Science","LATIN 2022: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20624-5_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,29]],"date-time":"2022-10-29T23:07:12Z","timestamp":1667084832000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20624-5_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031206238","9783031206245"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20624-5_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"29 October 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"LATIN","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Latin American Symposium on Theoretical Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Guanajuato","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mexico","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 November 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 November 2022","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":"latin2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/delta.cs.cinvestav.mx\/~francisco\/Latin22\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"114","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"46","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"40% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"8.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}