{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:26:28Z","timestamp":1769970388119,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319773124","type":"print"},{"value":"9783319773131","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/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-77313-1_18","type":"book-chapter","created":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:20:49Z","timestamp":1520371249000},"page":"232-244","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On Periodicity Lemma for Partial Words"],"prefix":"10.1007","author":[{"given":"Tomasz","family":"Kociumaka","sequence":"first","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,3,8]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","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":"18_CR2","doi-asserted-by":"crossref","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":"18_CR3","doi-asserted-by":"crossref","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."},{"issue":"1\u20132","key":"18_CR4","doi-asserted-by":"crossref","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."},{"key":"18_CR5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/j.jda.2012.04.001","volume":"16","author":"F Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Mandel, T., Sisodia, G.: Periods in partial words: an algorithm. J. Discrete Algorithms 16, 113\u2013128 (2012)","journal-title":"J. Discrete Algorithms"},{"issue":"5","key":"18_CR6","doi-asserted-by":"crossref","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":"18_CR7","doi-asserted-by":"crossref","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. Inform. Appl. 47(3), 215\u2013234 (2013)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"1","key":"18_CR8","doi-asserted-by":"crossref","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."},{"key":"18_CR9","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). \nhttp:\/\/eatcs.org\/images\/bulletin\/beatcs89.pdf","journal-title":"Bull. EATCS"},{"issue":"3","key":"18_CR10","doi-asserted-by":"crossref","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":"18_CR11","doi-asserted-by":"crossref","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":"18_CR12","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). \nhttps:\/\/doi.org\/10.1007\/BFb0017478"},{"issue":"5","key":"18_CR13","doi-asserted-by":"crossref","first-page":"373","DOI":"10.1051\/ita:2000122","volume":"34","author":"J Justin","year":"2000","unstructured":"Justin, J.: On a paper by Castelli, Mignosi, Restivo. RAIRO - Theor. Inform. Appl. 34(5), 373\u2013377 (2000)","journal-title":"RAIRO - Theor. Inform. Appl."},{"issue":"7","key":"18_CR14","doi-asserted-by":"crossref","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 \n            $$k$$\n          -abelian periods. Int. J. Found. Comput. Sci. 24(7), 1135\u20131152 (2013)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"18_CR15","volume-title":"Continued Fractions","author":"AY Khinchin","year":"1997","unstructured":"Khinchin, A.Y.: Continued Fractions. Dover Publications, New York (1997)"},{"key":"18_CR16","unstructured":"Kociumaka, T., Radoszewski, J., Rytter, W., Wale\u0144, T.: On periodicity lemma for partial words. ArXiv preprint. \nhttp:\/\/arxiv.org\/abs\/1801.01096"},{"key":"18_CR17","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words: Encyclopedia of Mathematics and its Applications","author":"M Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words: Encyclopedia of Mathematics and its Applications. Cambridge University Press, Cambridge (2002)"},{"key":"18_CR18","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). \nhttps:\/\/doi.org\/10.1007\/978-3-642-32589-2_58"},{"issue":"1","key":"18_CR19","doi-asserted-by":"crossref","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":"18_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44683-4_45"},{"issue":"3","key":"18_CR21","doi-asserted-by":"crossref","first-page":"360","DOI":"10.1017\/S1446788700031062","volume":"45","author":"T Ravenstein van","year":"1988","unstructured":"van Ravenstein, T.: The three gap theorem (Steinhaus conjecture). J. Aust. Math. Soc. 45(3), 360\u2013370 (1988)","journal-title":"J. Aust. Math. Soc."},{"issue":"4","key":"18_CR22","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1080\/0025570X.1981.11976921","volume":"54","author":"I Richards","year":"1981","unstructured":"Richards, I.: Continued fractions without tears. Math. Mag. 54(4), 163\u2013171 (1981)","journal-title":"Math. Mag."},{"key":"18_CR23","doi-asserted-by":"crossref","first-page":"405","DOI":"10.1070\/IM2004v068n02ABEH000480","volume":"68","author":"AM Shur","year":"2004","unstructured":"Shur, A.M., Gamzova, Y.V.: Partial words and the interaction property of periods. Izv. Math. 68, 405\u2013428 (2004)","journal-title":"Izv. Math."},{"key":"18_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"657","DOI":"10.1007\/3-540-44683-4_57","volume-title":"Mathematical Foundations of Computer Science 2001","author":"AM Shur","year":"2001","unstructured":"Shur, A.M., Konovalova, Y.V.: On the periods of partial words. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 657\u2013665. Springer, Heidelberg (2001). \nhttps:\/\/doi.org\/10.1007\/3-540-44683-4_57"},{"issue":"43","key":"18_CR25","doi-asserted-by":"crossref","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":"18_CR26","doi-asserted-by":"crossref","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":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-77313-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,3,6]],"date-time":"2018-03-06T21:29:27Z","timestamp":1520371767000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-77313-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319773124","9783319773131"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-77313-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}