{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:35:52Z","timestamp":1725730552115},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_23","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"252-263","source":"Crossref","is-referenced-by-count":7,"title":["Subword Complexity and k-Synchronization"],"prefix":"10.1007","author":[{"given":"Daniel","family":"Go\u010d","sequence":"first","affiliation":[]},{"given":"Luke","family":"Schaeffer","sequence":"additional","affiliation":[]},{"given":"Jeffrey","family":"Shallit","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1016\/0304-3975(92)90001-V","volume":"98","author":"J.-P. Allouche","year":"1992","unstructured":"Allouche, J.-P., Shallit, J.: The ring of k-regular sequences. Theoret. Comput. Sci.\u00a098, 163\u2013197 (1992)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0304-3975(03)00090-2","volume":"307","author":"J.-P. Allouche","year":"2003","unstructured":"Allouche, J.-P., Shallit, J.: The ring of k-regular sequences, II. Theoret. Comput. Sci.\u00a0307, 3\u201329 (2003)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR3","doi-asserted-by":"crossref","unstructured":"Allouche, J.-P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalization. Cambridge University Press (2003)","DOI":"10.1017\/CBO9780511546563"},{"key":"23_CR4","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1142\/S0218196709004968","volume":"19","author":"A. Carpi","year":"2009","unstructured":"Carpi, A., D\u2019Alonzo, V.: On the repetitivity index of infinite words. Internat. J. Algebra Comput.\u00a019, 145\u2013158 (2009)","journal-title":"Internat. J. Algebra Comput."},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"3932","DOI":"10.1016\/j.tcs.2010.08.005","volume":"411","author":"A. Carpi","year":"2010","unstructured":"Carpi, A., D\u2019Alonzo, V.: On factors of synchronized sequences. Theoret. Comput. Sci.\u00a0411, 3932\u20133937 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR6","doi-asserted-by":"publisher","first-page":"513","DOI":"10.1051\/ita:2001129","volume":"35","author":"A. Carpi","year":"2001","unstructured":"Carpi, A., Maggi, C.: On synchronized sequences and their separators. RAIRO Inform. Th\u00e9or. App.\u00a035, 513\u2013524 (2001)","journal-title":"RAIRO Inform. Th\u00e9or. App."},{"key":"23_CR7","unstructured":"Cassaigne, J.: Special factors of sequences with linear subword complexity. In: Dassow, J., Rozenberg, G., Salomaa, A. (eds.) Developments in Language Theory II, pp. 25\u201334. World Scientific (1996)"},{"key":"23_CR8","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":"23_CR9","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"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/S0166-218X(99)00199-7","volume":"100","author":"D. Damanik","year":"2000","unstructured":"Damanik, D.: Local symmetries in the period-doubling sequence. Disc. Appl. Math.\u00a0100, 115\u2013121 (2000)","journal-title":"Disc. Appl. Math."},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Dekking, F.M., Mend\u00e8s France, M., van der Poorten, A.J.: Folds! Math. Intelligencer\u00a04, 130\u2013138, 173\u2013181, 190\u2013195 (1982); Erratum 5, 5 (1983)","DOI":"10.1007\/BF03023552"},{"key":"23_CR12","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorems for periodic functions. Proc. Amer. Math. Soc.\u00a016, 109\u2013114 (1965)","journal-title":"Proc. Amer. Math. Soc."},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/978-3-642-37064-9_27","volume-title":"Language and Automata Theory and Applications","author":"D. Go\u010d","year":"2013","unstructured":"Go\u010d, D., Mousavi, H., Shallit, J.: On the number of unbordered factors. In: Dediu, A.-H., Mart\u00edn-Vide, C., Truthe, B. (eds.) LATA 2013. LNCS, vol.\u00a07810, pp. 299\u2013310. Springer, Heidelberg (2013)"},{"key":"23_CR14","doi-asserted-by":"publisher","first-page":"2084","DOI":"10.1016\/j.tcs.2009.01.025","volume":"410","author":"I. Goldstein","year":"2009","unstructured":"Goldstein, I.: Asymptotic subword complexity of fixed points of group substitutions. Theoret. Comput. Sci.\u00a0410, 2084\u20132098 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR15","doi-asserted-by":"publisher","first-page":"5728","DOI":"10.1016\/j.tcs.2011.06.019","volume":"412","author":"I. Goldstein","year":"2011","unstructured":"Goldstein, I.: Subword complexity of uniform D0L words over finite groups. Theoret. Comput. Sci.\u00a0412, 5728\u20135743 (2011)","journal-title":"Theoret. Comput. Sci."},{"key":"23_CR16","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation a\n                  \n                    M\n                  \u2009=\u2009b\n                  \n                    N\n                  \n                  c\n                  \n                    P\n                   in a free group. Michigan Math. J.\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Math. J."},{"key":"23_CR17","doi-asserted-by":"publisher","first-page":"1611","DOI":"10.1142\/S0129054112400655","volume":"23","author":"L. Schaeffer","year":"2012","unstructured":"Schaeffer, L., Shallit, J.: The critical exponent is computable for automatic sequences. Int. J. Found. Comput. Sci.\u00a023, 1611\u20131626 (2012)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Shallit, J.: The critical exponent is computable for automatic sequences. In: Ambroz, P., Holub, S., M\u00e1sakov\u00e1, Z. (eds.) Proceedings 8th International Conference Words 2011. Elect. Proc. Theor. Comput. Sci., vol.\u00a063, pp. 231\u2013239 (2011)","DOI":"10.4204\/EPTCS.63.29"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T00:27:32Z","timestamp":1557793652000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}