{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T21:15:08Z","timestamp":1743110108504,"version":"3.40.3"},"publisher-location":"Cham","reference-count":23,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319920153"},{"type":"electronic","value":"9783319920160"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"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":[[2018]]},"DOI":"10.1007\/978-3-319-92016-0_16","type":"book-chapter","created":{"date-parts":[[2018,5,21]],"date-time":"2018-05-21T13:54:16Z","timestamp":1526910856000},"page":"168-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["How Much Different Are Two Words with\u00a0Different Shortest Periods"],"prefix":"10.1007","author":[{"given":"Mai","family":"Alzamel","sequence":"first","affiliation":[]},{"given":"Maxime","family":"Crochemore","sequence":"additional","affiliation":[]},{"given":"Costas S.","family":"Iliopoulos","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Kociumaka","sequence":"additional","affiliation":[]},{"given":"Ritu","family":"Kundu","sequence":"additional","affiliation":[]},{"given":"Jakub","family":"Radoszewski","sequence":"additional","affiliation":[]},{"given":"Wojciech","family":"Rytter","sequence":"additional","affiliation":[]},{"given":"Tomasz","family":"Wale\u0144","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,5,22]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1016\/j.ipl.2017.08.005","volume":"128","author":"A Amir","year":"2017","unstructured":"Amir, A., Iliopoulos, C.S., Radoszewski, J.: Two strings at Hamming distance 1 cannot be both quasiperiodic. Inf. Process. Lett. 128, 54\u201357 (2017)","journal-title":"Inf. Process. Lett."},{"key":"16_CR2","unstructured":"Amir, A., Levy, A., Lubin, R., Porat, E.: Approximate cover of strings. In: K\u00e4rkk\u00e4inen, J., Radoszewski, J., Rytter, W. (eds.) 28th Annual Symposium on Combinatorial Pattern Matching, CPM 2017, 4\u20136 July 2017, Warsaw, Poland, vol. 78 of LIPIcs, pp. 26:1\u201326:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2017)"},{"key":"16_CR3","doi-asserted-by":"publisher","first-page":"30","DOI":"10.1016\/j.dam.2016.05.003","volume":"212","author":"H Bai","year":"2016","unstructured":"Bai, H., Franek, F., Smyth, W.F.: The new periodicity lemma revisited. Discrete Appl. Math. 212, 30\u201336 (2016)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"16_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theor. Comput. Sci. 218(1), 135\u2013141 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"16_CR5","doi-asserted-by":"publisher","first-page":"676","DOI":"10.1016\/j.ic.2007.11.007","volume":"206","author":"F Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri, F., Bal, D., Sisodia, G.: Graph connectivity, partial words, and a theorem of Fine and Wilf. Inf. Comput. 206(5), 676\u2013693 (2008)","journal-title":"Inf. Comput."},{"key":"16_CR6","unstructured":"Blanchet-Sadri, F., Corcoran, K., Nyberg, J.: Fine and Wilf\u2019s periodicity result on partial words and consequences. In: Loos, R., Fazekas, S.Z., Mart\u00edn-Vide, C., (eds.) Proceedings of the 1st International Conference on Language and Automata Theory and Applications, LATA 2007, Report 35\/07, pp. 115\u2013126. Research Group on Mathematical Linguistics, Universitat Rovira i Virgili, Tarragona (2007)"},{"issue":"1\u20132","key":"16_CR7","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1016\/S0304-3975(00)00407-2","volume":"270","author":"F Blanchet-Sadri","year":"2002","unstructured":"Blanchet-Sadri, F., Hegstrom, R.A.: Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci. 270(1\u20132), 401\u2013419 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"5","key":"16_CR8","doi-asserted-by":"publisher","first-page":"705","DOI":"10.1142\/S0129054110007519","volume":"21","author":"F Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Oey, T., Rankin, T.D.: Fine and Wilf\u2019s theorem for partial words with arbitrarily many weak periods. Int. J. Found. Comput. Sci. 21(5), 705\u2013722 (2010)","journal-title":"Int. J. Found. Comput. Sci."},{"issue":"3","key":"16_CR9","doi-asserted-by":"publisher","first-page":"215","DOI":"10.1051\/ita\/2013034","volume":"47","author":"F Blanchet-Sadri","year":"2013","unstructured":"Blanchet-Sadri, F., Simmons, S., Tebbe, A., Veprauskas, A.: Abelian periods, partial words, and an extension of a theorem of Fine and Wilf. RAIRO - Theor. Inf. Appl. 47(3), 215\u2013234 (2013)","journal-title":"RAIRO - Theor. Inf. Appl."},{"issue":"1","key":"16_CR10","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/S0304-3975(98)00251-5","volume":"218","author":"MG Castelli","year":"1999","unstructured":"Castelli, M.G., Mignosi, F., Restivo, A.: Fine and Wilf\u2019s theorem for three periods and a generalization of Sturmian words. Theor. Comput. Sci. 218(1), 83\u201394 (1999)","journal-title":"Theor. Comput. Sci."},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.tcs.2005.01.007","volume":"339","author":"S Constantinescu","year":"2005","unstructured":"Constantinescu, S., Ilie, L.: Generalised Fine and Wilf\u2019s theorem for arbitrary number of periods. Theor. Comput. Sci. 339(1), 49\u201360 (2005)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR12","first-page":"167","volume":"89","author":"S Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for Abelian periods. Bull. EATCS 89, 167\u2013170 (2006)","journal-title":"Bull. EATCS"},{"issue":"3","key":"16_CR13","doi-asserted-by":"publisher","first-page":"656","DOI":"10.1137\/050630180","volume":"20","author":"K Fan","year":"2006","unstructured":"Fan, K., Puglisi, S.J., Smyth, W.F., Turpin, A.: A new periodicity lemma. SIAM J. Discrete Math. 20(3), 656\u2013668 (2006)","journal-title":"SIAM J. Discrete Math."},{"issue":"1","key":"16_CR14","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"NJ Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Am. Math. Soc. 16(1), 109\u2013114 (1965)","journal-title":"Proc. Am. Math. Soc."},{"key":"16_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1007\/BFb0017478","volume-title":"Trees in Algebra and Programming \u2014 CAAP\u201994","author":"R Giancarlo","year":"1994","unstructured":"Giancarlo, R., Mignosi, F.: Generalizations of the periodicity theorem of Fine and Wilf. In: Tison, S. (ed.) CAAP 1994. LNCS, vol. 787, pp. 130\u2013141. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0017478"},{"issue":"4","key":"16_CR16","first-page":"583","volume":"40","author":"S Holub","year":"2006","unstructured":"Holub, S.: On multiperiodic words. ITA 40(4), 583\u2013591 (2006)","journal-title":"ITA"},{"issue":"5","key":"16_CR17","first-page":"373","volume":"34","author":"J Justin","year":"2000","unstructured":"Justin, J.: On a paper by Castelli, Mignosi, Restivo. ITA 34(5), 373\u2013377 (2000)","journal-title":"ITA"},{"issue":"7","key":"16_CR18","doi-asserted-by":"publisher","first-page":"1135","DOI":"10.1142\/S0129054113400352","volume":"24","author":"J Karhum\u00e4ki","year":"2013","unstructured":"Karhum\u00e4ki, J., Puzynina, S., Saarela, A.: Fine and Wilf\u2019s theorem for $$k$$-Abelian periods. Int. J. Found. Comput. Sci. 24(7), 1135\u20131152 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"16_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"668","DOI":"10.1007\/978-3-642-32589-2_58","volume-title":"Mathematical Foundations of Computer Science 2012","author":"F Manea","year":"2012","unstructured":"Manea, F., Merca\u015f, R., Nowotka, D.: Fine and Wilf\u2019s theorem and pseudo-repetitions. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 668\u2013680. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32589-2_58"},{"issue":"1","key":"16_CR20","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1016\/S0304-3975(01)00226-2","volume":"292","author":"F Mignosi","year":"2003","unstructured":"Mignosi, F., Restivo, A., Silva, P.V.: On Fine and Wilf\u2019s theorem for bidimensional words. Theor. Comput. Sci. 292(1), 245\u2013262 (2003)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1007\/3-540-44683-4_45","volume-title":"Mathematical Foundations of Computer Science 2001","author":"F Mignosi","year":"2001","unstructured":"Mignosi, F., Shallit, J., Wang, M.: Variations on a theorem of Fine & Wilf. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 512\u2013523. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-44683-4_45"},{"issue":"43","key":"16_CR22","doi-asserted-by":"publisher","first-page":"4295","DOI":"10.1016\/j.tcs.2009.07.010","volume":"410","author":"WF Smyth","year":"2009","unstructured":"Smyth, W.F., Wang, S.: A new approach to the periodicity lemma on strings with holes. Theor. Comput. Sci. 410(43), 4295\u20134302 (2009)","journal-title":"Theor. Comput. Sci."},{"issue":"30\u201332","key":"16_CR23","doi-asserted-by":"publisher","first-page":"3027","DOI":"10.1016\/j.tcs.2009.02.004","volume":"410","author":"R Tijdeman","year":"2009","unstructured":"Tijdeman, R., Zamboni, L.Q.: Fine and Wilf words for any periods II. Theor. Comput. Sci. 410(30\u201332), 3027\u20133034 (2009)","journal-title":"Theor. Comput. Sci."}],"container-title":["IFIP Advances in Information and Communication Technology","Artificial Intelligence Applications and Innovations"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-92016-0_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,21]],"date-time":"2022-05-21T00:04:24Z","timestamp":1653091464000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-92016-0_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319920153","9783319920160"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-92016-0_16","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"22 May 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIAI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Artificial Intelligence Applications and Innovations","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodes","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 May 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 May 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aiai2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/easyconferences.eu\/aiai2018\/index.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}