{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T00:54:51Z","timestamp":1743123291364,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319236599"},{"type":"electronic","value":"9783319236605"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-23660-5_13","type":"book-chapter","created":{"date-parts":[[2015,8,26]],"date-time":"2015-08-26T12:05:10Z","timestamp":1440590710000},"page":"147-159","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Prefix-Suffix Square Completion"],"prefix":"10.1007","author":[{"given":"Marius","family":"Dumitran","sequence":"first","affiliation":[]},{"given":"Florin","family":"Manea","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,8,27]]},"reference":[{"issue":"7","key":"13_CR1","doi-asserted-by":"publisher","first-page":"1254","DOI":"10.1016\/j.jcss.2014.02.011","volume":"80","author":"J Garc\u00eda-L\u00f3pez","year":"2014","unstructured":"Garc\u00eda-L\u00f3pez, J., Manea, F., Mitrana, V.: Prefix-suffix duplication. J. Comput. Syst. Sci. 80(7), 1254\u20131265 (2014)","journal-title":"J. Comput. Syst. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"176","DOI":"10.1007\/978-3-319-08846-4_13","volume-title":"Implementation and Application of Automata","author":"M Dumitran","year":"2014","unstructured":"Dumitran, M., Gil, J., Manea, F., Mitrana, V.: Bounded prefix-suffix duplication. In: Holzer, M., Kutrib, M. (eds.) CIAA 2014. LNCS, vol. 8587, pp. 176\u2013187. Springer, Heidelberg (2014)"},{"key":"13_CR3","first-page":"1","volume":"7","author":"A Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Skrifter I. Mat.-Nat. Kl., Christiania 7, 1\u201322 (1906)","journal-title":"Norske Vid. Skrifter I. Mat.-Nat. Kl., Christiania"},{"key":"13_CR4","first-page":"1","volume":"1","author":"A Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Skrifter I. Mat.-Nat. Kl., Christiania 1, 1\u201367 (1912)","journal-title":"Norske Vid. Skrifter I. Mat.-Nat. Kl., Christiania"},{"key":"13_CR5","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511566097","volume-title":"Comb. Words","author":"M Lothaire","year":"1997","unstructured":"Lothaire, M.: Comb. Words. Cambridge University Press, Cambridge (1997)"},{"key":"13_CR6","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences - Theory, Applications, Generalizations","author":"J Allouche","year":"2003","unstructured":"Allouche, J., Shallit, J.O.: Automatic Sequences - Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"issue":"1\u20132","key":"13_CR7","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(99)00199-7","volume":"100","author":"D Damanik","year":"2000","unstructured":"Damanik, D.: Local symmetries in the period-doubling sequence. Discrete Appl. Math. 100(1\u20132), 115\u2013121 (2000)","journal-title":"Discrete Appl. Math."},{"key":"13_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1016\/j.disc.2014.01.002","volume":"322","author":"JD Currie","year":"2014","unstructured":"Currie, J.D., Rampersad, N., Saari, K., Zamboni, L.Q.: Extremal words in morphic subshifts. Discrete Math. 322, 53\u201360 (2014)","journal-title":"Discrete Math."},{"issue":"A6","key":"13_CR9","first-page":"1","volume":"11B","author":"J Endrullis","year":"2011","unstructured":"Endrullis, J., Hendriks, D., Klop, J.W.: Degrees of streams. Integers Electron. J. Comb. Number Theor. 11B(A6), 1\u201340 (2011)","journal-title":"Integers Electron. J. Comb. Number Theor."},{"key":"13_CR10","series-title":"Lectures on Modern Mathematics","volume-title":"Generators and Relations in Groups - The Burnside Problem","author":"M Hall","year":"1964","unstructured":"Hall, M.: Generators and Relations in Groups - The Burnside Problem. Lectures on Modern Mathematics, vol. 2. Wiley, New York (1964). 42\u201392"},{"key":"13_CR11","doi-asserted-by":"publisher","first-page":"918","DOI":"10.1145\/1217856.1217858","volume":"53","author":"J K\u00e4rkk\u00e4inen","year":"2006","unstructured":"K\u00e4rkk\u00e4inen, J., Sanders, P., Burkhardt, S.: Linear work suffix array construction. J. ACM 53, 918\u2013936 (2006)","journal-title":"J. ACM"},{"key":"13_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/10719839_9","volume-title":"LATIN 2000: Theoretical Informatics","author":"MA Bender","year":"2000","unstructured":"Bender, M.A., Farach-Colton, M.: The LCA problem revisited. In: Gonnet, G.H., Viola, A. (eds.) LATIN 2000. LNCS, vol. 1776, pp. 88\u201394. Springer, Heidelberg (2000)"},{"key":"13_CR13","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511574931","volume-title":"Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology","author":"D Gusfield","year":"1997","unstructured":"Gusfield, D.: Algorithms on Strings, Trees, and Sequences: Computer Science and Computational Biology. Cambridge University Press, New York (1997)"},{"key":"13_CR14","doi-asserted-by":"crossref","unstructured":"Kolpakov, R., Kucherov, G.: Finding maximal repetitions in a word in linear time. In: Proceedings of FOCS, pp. 596\u2013604 (1999)","DOI":"10.1007\/3-540-48321-7_31"},{"key":"13_CR15","doi-asserted-by":"crossref","unstructured":"Bannai, H., I, T., Inenaga, S., Nakashima, Y., Takeda, M., Tsuruta, K.: A new characterization of maximal repetitions by Lyndon trees. In: Proceedings of SODA, pp. 562\u2013571 (2015)","DOI":"10.1137\/1.9781611973730.38"},{"issue":"2","key":"13_CR16","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"DE Knuth Jr","year":"1977","unstructured":"Knuth Jr., D.E., Morris, J.H., Pratt, V.R.: Fast pattern matching in strings. SIAM J. Comput. 6(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."}],"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-319-23660-5_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,21]],"date-time":"2023-02-21T08:18:54Z","timestamp":1676967534000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-23660-5_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319236599","9783319236605"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-23660-5_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"27 August 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}