{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T16:56:38Z","timestamp":1725468998957},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540377917"},{"type":"electronic","value":"9783540377931"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11821069_14","type":"book-chapter","created":{"date-parts":[[2006,8,25]],"date-time":"2006-08-25T10:25:12Z","timestamp":1156501512000},"page":"157-166","source":"Crossref","is-referenced-by-count":6,"title":["Crochemore Factorization of Sturmian and Other Infinite Words"],"prefix":"10.1007","author":[{"given":"Jean","family":"Berstel","sequence":"first","affiliation":[]},{"given":"Alessandra","family":"Savelli","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences. Cambridge University Press, Cambridge (2003)"},{"key":"14_CR2","first-page":"781","volume":"296","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M.: Recherche lin\u00e9aire d\u2019un carr\u00e9 dans un mot. Comptes Rendus Sci. Paris S\u00e9r. I Math.\u00a0296, 781\u2013784 (1983)","journal-title":"Comptes Rendus Sci. Paris S\u00e9r. I Math."},{"key":"14_CR3","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithmique du texte. Vuibert (2001)"},{"key":"14_CR4","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. The Clarendon Press, Oxford University Press (1994)"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1016\/0020-0190(95)00067-M","volume":"54","author":"A. Luca de","year":"1995","unstructured":"de Luca, A.: A division property of the Fibonacci word. Information Processing Letters\u00a054, 307\u2013312 (1995)","journal-title":"Information Processing Letters"},{"volume-title":"Applied Combinatorics on Words","year":"2005","author":"R. Kolpakov","key":"14_CR6","unstructured":"Kolpakov, R., Kucherov, G.: Periodic structures on words, in Lothaire. In: Applied Combinatorics on Words, Cambridge University Press, Cambridge (2005)"},{"key":"14_CR7","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1109\/TIT.1976.1055501","volume":"IT-22","author":"A. Lempel","year":"1976","unstructured":"Lempel, A., Ziv, J.: On the complexity of finite sequences. IEEE Transactions in Information Theory\u00a0IT-22, 75\u201381 (1976)","journal-title":"IEEE Transactions in Information Theory"},{"key":"14_CR8","doi-asserted-by":"publisher","first-page":"587","DOI":"10.1006\/eujc.1994.1060","volume":"15","author":"Z.-X. Wen","year":"1994","unstructured":"Wen, Z.-X., Wen, Z.-Y.: Some properties of the singular words of the Fibonacci word. European Journal of Combinatorics\u00a015, 587\u2013598 (1994)","journal-title":"European Journal of Combinatorics"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11821069_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T07:30:33Z","timestamp":1619508633000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11821069_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540377917","9783540377931"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/11821069_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}
