{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T07:51:39Z","timestamp":1743148299213,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642370632"},{"type":"electronic","value":"9783642370649"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-37064-9_27","type":"book-chapter","created":{"date-parts":[[2013,3,15]],"date-time":"2013-03-15T08:07:12Z","timestamp":1363334832000},"page":"299-310","source":"Crossref","is-referenced-by-count":12,"title":["On the Number of Unbordered Factors"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hamoon","family":"Mousavi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"27_CR1","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"27_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1007\/978-3-642-22321-1_15","volume-title":"Developments in Language Theory","author":"\u00c9. Charlier","year":"2011","unstructured":"Charlier, \u00c9., Rampersad, N., Shallit, J.: Enumeration and Decidable Properties of Automatic Sequences. In: Mauri, G., Leporati, A. (eds.) DLT 2011. LNCS, vol.\u00a06795, pp. 165\u2013179. Springer, Heidelberg (2011)"},{"key":"27_CR3","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/BF01706087","volume":"6","author":"A. Cobham","year":"1972","unstructured":"Cobham, A.: Uniform tag sequences. Math. Systems Theory\u00a06, 164\u2013192 (1972)","journal-title":"Math. Systems Theory"},{"issue":"1","key":"27_CR4","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1051\/ita:2008006","volume":"43","author":"J.D. Currie","year":"2009","unstructured":"Currie, J.D., Saari, K.: Least periods of factors of infinite words. RAIRO Inform. Th\u00e9or. App.\u00a043(1), 165\u2013178 (2009)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"27_CR5","doi-asserted-by":"publisher","first-page":"2261","DOI":"10.1016\/j.disc.2006.09.054","volume":"308","author":"J.-P. Duval","year":"2008","unstructured":"Duval, J.-P., Harju, T., Nowotka, D.: Unbordered factors and Lyndon words. Discrete Math.\u00a0308, 2261\u20132264 (2008)","journal-title":"Discrete Math."},{"key":"27_CR6","doi-asserted-by":"publisher","first-page":"101","DOI":"10.1016\/0012-365X(79)90116-X","volume":"26","author":"A. Ehrenfeucht","year":"1979","unstructured":"Ehrenfeucht, A., Silberger, D.M.: Periodicity and unbordered segments of words. Discrete Math.\u00a026, 101\u2013109 (1979)","journal-title":"Discrete Math."},{"key":"27_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"180","DOI":"10.1007\/978-3-642-31606-7_16","volume-title":"Implementation and Application of Automata","author":"D. Go\u010d","year":"2012","unstructured":"Go\u010d, D., Henshall, D., Shallit, J.: Automatic Theorem-Proving in Combinatorics on Words. In: Moreira, N., Reis, R. (eds.) CIAA 2012. LNCS, vol.\u00a07381, pp. 180\u2013191. Springer, Heidelberg (2012)"},{"key":"27_CR8","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1145\/1255443.1255448","volume":"54","author":"T. Harju","year":"2007","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words: a proof of the extended Duval conjecture. J. Assoc. Comput. Mach. 54, Article 20 (2007)","journal-title":"J. Assoc. Comput. Mach."},{"key":"27_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/j.tcs.2005.01.008","volume":"339","author":"S. Holub","year":"2005","unstructured":"Holub, S.: A proof of the extended Duval\u2019s conjecture. Theoret. Comput. Sci.\u00a0339, 61\u201367 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"27_CR10","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054110007465","volume":"21","author":"S. Holub","year":"2010","unstructured":"Holub, S., Nowotka, D.: On the relation between periodicity and unbordered factors of finite words. Internat. J. Found. Comp. Sci.\u00a021, 633\u2013645 (2010)","journal-title":"Internat. J. Found. Comp. Sci."},{"key":"27_CR11","doi-asserted-by":"publisher","first-page":"704","DOI":"10.1109\/TIT.1973.1055065","volume":"IT-19","author":"P.T. Nielsen","year":"1973","unstructured":"Nielsen, P.T.: A note on bifix-free sequences. IEEE Trans. Inform. Theory\u00a0IT-19, 704\u2013706 (1973)","journal-title":"IEEE Trans. Inform. Theory"},{"key":"27_CR12","first-page":"191","volume":"30","author":"D.M. Silberger","year":"1971","unstructured":"Silberger, D.M.: Borders and roots of a word. Portugal. Math.\u00a030, 191\u2013199 (1971)","journal-title":"Portugal. Math."},{"key":"27_CR13","first-page":"143","volume":"22","author":"D.M. Silberger","year":"1980","unstructured":"Silberger, D.M.: How many unbordered words? Ann. Soc. Math. Polon. Ser. I: Comment. Math.\u00a022, 143\u2013145 (1980)","journal-title":"Ann. Soc. Math. Polon. Ser. I: Comment. Math."}],"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-642-37064-9_27","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,19]],"date-time":"2023-01-19T09:27:00Z","timestamp":1674120420000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-642-37064-9_27"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642370632","9783642370649"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-37064-9_27","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}