{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T11:57:44Z","timestamp":1776859064725,"version":"3.51.2"},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319155784","type":"print"},{"value":"9783319155791","type":"electronic"}],"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-15579-1_29","type":"book-chapter","created":{"date-parts":[[2015,2,23]],"date-time":"2015-02-23T08:36:13Z","timestamp":1424680573000},"page":"381-390","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["On the Number of Closed Factors in a Word"],"prefix":"10.1007","author":[{"given":"Golnaz","family":"Badkobeh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gabriele","family":"Fici","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zsuzsanna","family":"Lipt\u00e1k","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2015,2,24]]},"reference":[{"key":"29_CR1","unstructured":"Badkobeh, G., Bannai, H., Goto, K., I, T., Iliopoulos, C.S., Inenaga, S., Puglisi, S.J., Sugimoto, S.: Closed factorization. In: Proceedings of the Prague Stringology Conference 2014, pp. 162\u2013168 (2014)"},{"key":"29_CR2","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1142\/S012905410400242X","volume":"15","author":"S Brlek","year":"2004","unstructured":"Brlek, S., Hamel, S., Nivat, M., Reutenauer, C.: On the palindromic complexity of infinite words. Internat. J. Found. Comput. Sci. 15, 293\u2013306 (2004)","journal-title":"Internat. J. Found. Comput. Sci."},{"key":"29_CR3","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/j.tcs.2012.11.007","volume":"468","author":"M Bucci","year":"2013","unstructured":"Bucci, M., De Luca, A., Fici, G.: Enumeration and Structure of Trapezoidal Words. Theoret. Comput. Sci. 468, 12\u201322 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"30","key":"29_CR4","doi-asserted-by":"publisher","first-page":"2860","DOI":"10.1016\/j.tcs.2008.11.001","volume":"410","author":"M Bucci","year":"2009","unstructured":"Bucci, M., De Luca, A., Glen, A., Zamboni, L.: A new characteristic property of rich words. Theoretical Computer Science 410(30), 2860\u20132863 (2009)","journal-title":"Theoretical Computer Science"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1007\/978-3-642-02737-6_11","volume-title":"Developments in Language Theory","author":"M Bucci","year":"2009","unstructured":"Bucci, M., de Luca, A., De Luca, A.: Rich and periodic-like words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol. 5583, pp. 145\u2013155. Springer, Heidelberg (2009)"},{"key":"29_CR6","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/PL00013314","volume":"37","author":"A Carpi","year":"2001","unstructured":"Carpi, A., de Luca, A.: Periodic-like words, periodicity and boxes. Acta Inform. 37, 597\u2013618 (2001)","journal-title":"Acta Inform."},{"key":"29_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1007\/978-3-642-40579-2_15","volume-title":"Combinatorics on Words","author":"A De Luca","year":"2013","unstructured":"De Luca, A., Fici, G.: Open and closed prefixes of sturmian words. In: Karhum\u00e4ki, J., Lepist\u00f6, A., Zamboni, L. (eds.) WORDS 2013. LNCS, vol. 8079, pp. 132\u2013142. Springer, Heidelberg (2013)"},{"issue":"1\u20132","key":"29_CR8","doi-asserted-by":"publisher","first-page":"539","DOI":"10.1016\/S0304-3975(99)00320-5","volume":"255","author":"X Droubay","year":"2001","unstructured":"Droubay, X., Justin, J., Pirillo, G.: Episturmian words and some constructions of de Luca and Rauzy. Theoret. Comput. Sci. 255(1\u20132), 539\u2013553 (2001)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR9","doi-asserted-by":"crossref","unstructured":"Fici, G.: A classification of trapezoidal words. In: WORDS 2011, 8th International Conference on Words. Electronic Proceedings in Theoretical Computer Science, vol. 63, pp. 129\u2013137 (2011)","DOI":"10.4204\/EPTCS.63.18"},{"key":"29_CR10","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1016\/j.ejc.2008.04.006","volume":"30","author":"A Glen","year":"2009","unstructured":"Glen, A., Justin, J., Widmer, S., Zamboni, L.Q.: Palindromic richness. European J. Combin. 30, 510\u2013531 (2009)","journal-title":"European J. Combin."},{"key":"29_CR11","doi-asserted-by":"publisher","first-page":"57","DOI":"10.1016\/j.tcs.2013.05.028","volume":"500","author":"J Peltom\u00e4ki","year":"2013","unstructured":"Peltom\u00e4ki, J.: Introducing privileged words: Privileged complexity of Sturmian words. Theoret. Comput. Sci. 500, 57\u201367 (2013)","journal-title":"Theoret. Comput. Sci."},{"issue":"30","key":"29_CR12","doi-asserted-by":"publisher","first-page":"3018","DOI":"10.1016\/j.tcs.2009.03.008","volume":"410","author":"A Restivo","year":"2009","unstructured":"Restivo, A., Rosone, G.: Burrows-Wheeler transform and palindromic richness. Theoret. Comput. Sci. 410(30), 3018\u20133026 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR13","unstructured":"Sloane, N.J.A.: The On-Line Encyclopedia of Integer Sequences. Available electronically at http:\/\/oeis.org, Sequence A226452: Number of closed binary words of length $$n$$"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-15579-1_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,2,15]],"date-time":"2023-02-15T04:14:42Z","timestamp":1676434482000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-15579-1_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319155784","9783319155791"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-15579-1_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"24 February 2015","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}