{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T22:23:46Z","timestamp":1743027826448,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662531310"},{"type":"electronic","value":"9783662531327"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-662-53132-7_15","type":"book-chapter","created":{"date-parts":[[2016,7,20]],"date-time":"2016-07-20T01:25:06Z","timestamp":1468977906000},"page":"177-189","source":"Crossref","is-referenced-by-count":0,"title":["Ternary Square-Free Partial Words with Many Wildcards"],"prefix":"10.1007","author":[{"given":"Daniil","family":"Gasnikov","sequence":"first","affiliation":[]},{"given":"Arseny M.","family":"Shur","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,7,21]]},"reference":[{"key":"15_CR1","first-page":"769","volume":"2","author":"SE Arshon","year":"1937","unstructured":"Arshon, S.E.: Proof of the existence of asymmetric infinite sequences. Mat. Sbornik 2, 769\u2013779 (1937). in Russian, with French abstract","journal-title":"Mat. Sbornik"},{"key":"15_CR2","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoret. Comput. Sci. 218, 135\u2013141 (1999)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"155","DOI":"10.1007\/978-3-642-21254-3_11","volume-title":"Language and Automata Theory and Applications","author":"F Blanchet-Sadri","year":"2011","unstructured":"Blanchet-Sadri, F., Black, K., Zemke, A.: Unary pattern avoidance in partial words dense with holes. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol. 6638, pp. 155\u2013166. Springer, Heidelberg (2011)"},{"issue":"1\u20132","key":"15_CR4","doi-asserted-by":"crossref","first-page":"401","DOI":"10.1016\/S0304-3975(00)00407-2","volume":"270","author":"F Blanchet-Sadri","year":"2002","unstructured":"Blanchet-Sadri, F., Hegstrom, R.A.: Partial words and a theorem of Fine and Wilf revisited. Theor. Comput. Sci. 270(1\u20132), 401\u2013419 (2002)","journal-title":"Theor. Comput. Sci."},{"key":"15_CR5","doi-asserted-by":"crossref","first-page":"793","DOI":"10.1016\/j.tcs.2008.11.006","volume":"410","author":"F Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: A generalization of Thue freeness for partial words. Theoret. Comput. Sci. 410, 793\u2013800 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR6","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F Dejean","year":"1972","unstructured":"Dejean, F.: Sur un th\u00e9or\u00e8me de Thue. J. Combin. Theory. Ser. A 13, 90\u201399 (1972)","journal-title":"J. Combin. Theory. Ser. A"},{"key":"15_CR7","first-page":"113","volume":"7","author":"M Fischer","year":"1974","unstructured":"Fischer, M., Paterson, M.: String matching and other products. SIAM-AMS Proc. 7, 113\u2013125 (1974)","journal-title":"SIAM-AMS Proc."},{"issue":"5","key":"15_CR8","doi-asserted-by":"crossref","first-page":"290","DOI":"10.1016\/j.ipl.2008.06.001","volume":"108","author":"V Halava","year":"2008","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: Square-free partial words. Inform. Process. Lett. 108(5), 290\u2013292 (2008)","journal-title":"Inform. Process. Lett."},{"issue":"1\u20132","key":"15_CR9","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1016\/j.tcs.2007.09.028","volume":"389","author":"F Manea","year":"2007","unstructured":"Manea, F., Merca\u015f, R.: Freeness of partial words. Theoret. Comput. Sci. 389(1\u20132), 265\u2013277 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"15_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"356","DOI":"10.1007\/3-540-56287-7_118","volume-title":"Foundations of Software Technology and Theoretical Computer Science","author":"S Muthukrishnan","year":"1992","unstructured":"Muthukrishnan, S., Ramesh, H.: String matching under a general matching relation. In: Shyamasundar, R.K. (ed.) FSTTCS 1992. LNCS, vol. 652, pp. 356\u2013367. Springer, Heidelberg (1992)"},{"key":"15_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"752","DOI":"10.1007\/978-3-642-32589-2_65","volume-title":"Mathematical Foundations of Computer Science 2012","author":"EA Petrova","year":"2012","unstructured":"Petrova, E.A., Shur, A.M.: Constructing premaximal ternary square-free words of any level. In: Rovan, B., Sassone, V., Widmayer, P. (eds.) MFCS 2012. LNCS, vol. 7464, pp. 752\u2013763. Springer, Heidelberg (2012)"},{"key":"15_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"223","DOI":"10.1007\/978-3-319-23660-5_19","volume-title":"Combinatorics on Words","author":"EA Petrova","year":"2015","unstructured":"Petrova, E.A., Shur, A.M.: On the tree of ternary square-free words. In: Manea, F., Nowotka, D. (eds.) WORDS 2015. LNCS, vol. 9304, pp. 223\u2013236. Springer, Heidelberg (2015)"},{"issue":"1","key":"15_CR13","doi-asserted-by":"crossref","first-page":"P1.18","DOI":"10.37236\/5424","volume":"23","author":"EA Petrova","year":"2016","unstructured":"Petrova, E.A.: Avoiding letter patterns in ternary square-free words. Electr. J. Comb. 23(1), P1.18 (2016)","journal-title":"Electr. J. Comb."},{"key":"15_CR14","doi-asserted-by":"crossref","first-page":"R140","DOI":"10.37236\/412","volume":"17","author":"AM Shur","year":"2010","unstructured":"Shur, A.M.: On ternary square-free circular words. Electronic J. Combinatorics 17, R140 (2010)","journal-title":"Electronic J. Combinatorics"},{"key":"15_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1007\/3-540-44683-4_57","volume-title":"Mathematical Foundations of Computer Science 2001","author":"AM Shur","year":"2001","unstructured":"Shur, A.M., Konovalova, Y.V.: On the periods of partial words. In: Sgall, J., Pultr, A., Kolman, P. (eds.) MFCS 2001. LNCS, vol. 2136, pp. 657\u2013665. Springer, Heidelberg (2001)"}],"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-662-53132-7_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,24]],"date-time":"2020-09-24T03:52:57Z","timestamp":1600919577000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-53132-7_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662531310","9783662531327"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-53132-7_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}