{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T14:47:25Z","timestamp":1770994045972,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540212362","type":"print"},{"value":"9783540247494","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24749-4_26","type":"book-chapter","created":{"date-parts":[[2010,9,8]],"date-time":"2010-09-08T15:01:54Z","timestamp":1283958114000},"page":"294-304","source":"Crossref","is-referenced-by-count":11,"title":["Periodicity and Unbordered Words"],"prefix":"10.1007","author":[{"given":"Tero","family":"Harju","sequence":"first","affiliation":[]},{"given":"Dirk","family":"Nowotka","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/0012-365X(79)90146-8","volume":"25","author":"R. Assous","year":"1979","unstructured":"Assous, R., Pouzet, M.: Une caract\u00e9risation des mots p\u00e9riodiques. Discrete Math.\u00a025(1), 1\u20135 (1979)","journal-title":"Discrete Math."},{"key":"26_CR2","series-title":"Pure and Applied Mathematics","volume-title":"Theory of codes","author":"J. Berstel","year":"1985","unstructured":"Berstel, J., Perrin, D.: Theory of codes. Pure and Applied Mathematics, vol.\u00a0117. Academic Press Inc., Orlando (1985)"},{"issue":"10","key":"26_CR3","doi-asserted-by":"publisher","first-page":"762","DOI":"10.1145\/359842.359859","volume":"20","author":"R.S. Boyer","year":"1977","unstructured":"Boyer, R.S., Moore, J.S.: A fast string searching algorithm. Commun. ACM\u00a020(10), 762\u2013772 (1977)","journal-title":"Commun. ACM"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Breslauer, D., Jiang, T., Jiang, Z.: Rotations of periodic strings and short superstrings. J. Algorithms\u00a024(2) (1997)","DOI":"10.1006\/jagm.1997.0861"},{"key":"26_CR5","series-title":"Telecommunications Series","volume-title":"Digital transmission systems","author":"P. Bylanski","year":"1980","unstructured":"Bylanski, P., Ingram, D.G.W.: Digital transmission systems. Telecommunications Series, vol.\u00a04. IEEE, Los Alamitos (1980)"},{"key":"26_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"261","DOI":"10.1007\/3-540-48523-6_23","volume-title":"Automata, Languages and Programming","author":"M. Crochemore","year":"1999","unstructured":"Crochemore, M., Mignosi, F., Restivo, A., Salemi, S.: Text compression using antidictionaries. In: Wiedermann, J., Van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol.\u00a01644, pp. 261\u2013270. Springer, Heidelberg (1999)"},{"issue":"3","key":"26_CR7","doi-asserted-by":"publisher","first-page":"651","DOI":"10.1145\/116825.116845","volume":"38","author":"M. Crochemore","year":"1991","unstructured":"Crochemore, M., Perrin, D.: Two-way string-matching. J. ACM\u00a038(3), 651\u2013675 (1991)","journal-title":"J. ACM"},{"issue":"1","key":"26_CR8","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/0012-365X(82)90186-8","volume":"40","author":"J.-P. Duval","year":"1982","unstructured":"Duval, J.-P.: Relationship between the period of a finite word and the length of its unbordered segments. Discrete Math.\u00a040(1), 31\u201344 (1982)","journal-title":"Discrete Math."},{"key":"26_CR9","unstructured":"Duval, J.-P., Harju, T., Nowotka, D.: Unbordered factors and Lyndon words (submitted)"},{"issue":"2","key":"26_CR10","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(2), 101\u2013109 (1979)","journal-title":"Discrete Math."},{"key":"26_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"316","DOI":"10.1007\/3-540-45007-6_25","volume-title":"Developments in Language Theory","author":"T. Harju","year":"2003","unstructured":"Harju, T., Nowotka, D.: About Duval\u2019s conjecture. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 316\u2013324. Springer, Heidelberg (2003)"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Harju, T., Nowotka, D.: Periodicity and unbordered words. TUCS Tech. Rep. 523, Turku Centre of Computer Science, Finland (April 2003)","DOI":"10.1007\/978-3-540-24749-4_26"},{"key":"26_CR13","unstructured":"Holub, S.: A proof of Duval\u2019s conjecture. In: Harju, T., Karhum\u00e4ki, J. (eds.) Optimization Techniques 1974. Turku Centre of Computer Science, vol.\u00a027, pp. 398\u2013399. TUCS General Publications (2003)"},{"key":"26_CR14","unstructured":"Holub, S.: Unbordered words and lexicographic orderings. personal communication (July 2003)"},{"issue":"2","key":"26_CR15","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1137\/0206024","volume":"6","author":"D.E. Knuth","year":"1977","unstructured":"Knuth, D.E., Morris, J.H., Pratt, V.R.: Fast Pattern matching in strings. SIAM J. Comput.\u00a06(2), 323\u2013350 (1977)","journal-title":"SIAM J. Comput."},{"key":"26_CR16","series-title":"Encyclopedia of Mathematics and its Applications","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a090. Cambridge University Press, Cambridge (2002)"},{"key":"26_CR17","first-page":"613","volume-title":"36th Annual Symposium on Foundations of Computer Science (FOCS)","author":"D. Margaritis","year":"1995","unstructured":"Margaritis, D., Skiena, S.: Reconstructing strings from substrings in rounds. In: 36th Annual Symposium on Foundations of Computer Science (FOCS), Milwaukee, WI, pp. 613\u2013620. IEEE Computer Society, Los Alamitos (1995)"},{"issue":"1","key":"26_CR18","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1051\/ita:2002001","volume":"36","author":"F. Mignosi","year":"2002","unstructured":"Mignosi, F., Zamboni, L.Q.: A note on a conjecture of Duval and Sturmian words. Theor. Inform. Appl.\u00a036(1), 1\u20133 (2002)","journal-title":"Theor. Inform. Appl."},{"issue":"3","key":"26_CR19","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J. Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Information Theory\u00a023(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Information Theory"}],"container-title":["Lecture Notes in Computer Science","STACS 2004"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24749-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,4]],"date-time":"2019-06-04T01:33:50Z","timestamp":1559612030000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24749-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540212362","9783540247494"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24749-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}