{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,1]],"date-time":"2026-02-01T18:36:22Z","timestamp":1769970982465,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540424963","type":"print"},{"value":"9783540446835","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44683-4_57","type":"book-chapter","created":{"date-parts":[[2007,8,28]],"date-time":"2007-08-28T21:32:38Z","timestamp":1188336758000},"page":"657-665","source":"Crossref","is-referenced-by-count":9,"title":["On the Periods of Partial Words"],"prefix":"10.1007","author":[{"given":"Arseny M.","family":"Shur","sequence":"first","affiliation":[]},{"given":"Yulia V.","family":"Konovalova","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,5]]},"reference":[{"key":"57_CR1","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J. Berstel","year":"1999","unstructured":"J. Berstel, L. Boasson, Partial words and a theorem of Fine and Wilf, Theor. Comp. Sci., 218 (1999), 135\u2013141.","journal-title":"Theor. Comp. Sci."},{"key":"57_CR2","doi-asserted-by":"publisher","first-page":"109","DOI":"10.2307\/2034009","volume":"16","author":"N. J. Fine","year":"1965","unstructured":"N. J. Fine, H. S. Wilf, Uniqueness theorem for periodic functions, Proc. Amer. Math. Soc., 16 (1965), 109\u2013114.","journal-title":"Proc. Amer. Math. Soc."},{"key":"57_CR3","volume-title":"Handbook of formal languages","author":"C. Choffrut","year":"1997","unstructured":"C. Choffrut, J. Karhum\u00e4ki, Combinatorics on words, in: G. Rosenberg, A. Salomaa (Eds.), Handbook of formal languages, v. 1, Ch.6, Springer, Berlin, 1997."}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2001"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44683-4_57","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,23]],"date-time":"2019-02-23T01:32:10Z","timestamp":1550885530000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44683-4_57"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540424963","9783540446835"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-44683-4_57","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}