{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,3]],"date-time":"2022-04-03T13:46:52Z","timestamp":1648993612188},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2010,12,10]],"date-time":"2010-12-10T00:00:00Z","timestamp":1291939200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2011,2]]},"DOI":"10.1007\/s00236-010-0129-0","type":"journal-article","created":{"date-parts":[[2010,12,9]],"date-time":"2010-12-09T03:29:12Z","timestamp":1291865352000},"page":"25-41","source":"Crossref","is-referenced-by-count":9,"title":["Avoidable binary patterns in partial words"],"prefix":"10.1007","volume":"48","author":[{"given":"F.","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eric","family":"Weissenstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2010,12,10]]},"reference":[{"key":"129_CR1","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D.R. Bean","year":"1979","unstructured":"Bean D.R., Ehrenfeucht A., McNulty G.: Avoidable patterns in strings of symbols. Pac. J. Math. 85, 261\u2013294 (1979)","journal-title":"Pac. J. Math."},{"key":"129_CR2","volume-title":"Algorithmic Combinatorics on Partial Words","author":"F. Blanchet-Sadri","year":"2008","unstructured":"Blanchet-Sadri F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press, Boca Raton (2008)"},{"issue":"8\u201310","key":"129_CR3","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. Theor. Comput. Sci. 410(8\u201310), 793\u2013800 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"129_CR4","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. In: Dediu, A.-H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010, 4th International Conference on Language and Automata Theory and Applications, Trier, Germany, Lecture Notes in Computer Science, vol. 6031, pp. 106\u2013117. Springer, Berlin (2010)","DOI":"10.1007\/978-3-642-13089-2_9"},{"key":"129_CR5","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1007\/BF01209712","volume":"30","author":"J. Cassaigne","year":"1993","unstructured":"Cassaigne J.: Unavoidable binary patterns. Acta Informatica 30, 385\u2013395 (1993)","journal-title":"Acta Informatica"},{"issue":"8\u201310","key":"129_CR6","doi-asserted-by":"crossref","first-page":"943","DOI":"10.1016\/j.tcs.2008.12.041","volume":"410","author":"V. Halava","year":"2009","unstructured":"Halava V., Harju T., K\u00e4rki T., S\u00e9\u00e9bold P.: Overlap-freeness in infinite partial words. Theor. Comput. Sci. {\\bf 410acute;(8\u201310), 943\u2013948 (2009)","journal-title":"Theor. Comput. Sci."},{"key":"129_CR7","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511566097","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1997","unstructured":"Lothaire M.: Combinatorics on Words. Cambridge University Press, Cambridge (1997)"},{"key":"129_CR8","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. Cambridge University Press, Cambridge (2002)"},{"issue":"1\u20132","key":"129_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. Theor. Comput. Sci. 389(1\u20132), 265\u2013277 (2007)","journal-title":"Theor. Comput. Sci."},{"key":"129_CR10","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1007\/BF01178567","volume":"29","author":"P. Roth","year":"1992","unstructured":"Roth P.: Every binary pattern of length six is avoidable on the two-letter alphabet. Acta Informatica 29, 95\u2013106 (1992)","journal-title":"Acta Informatica"},{"key":"129_CR11","unstructured":"Schmidt, U.: Motifs in\u00e9vitables dans les mots. Technical Report LITP 86\u201363 Th\u00e8se Paris VI (1986)"},{"key":"129_CR12","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(89)90064-9","volume":"63","author":"U. Schmidt","year":"1989","unstructured":"Schmidt U.: Avoidable patterns on two letters. Theor. Comput. Sci. 63, 1\u201317 (1989)","journal-title":"Theor. Comput. Sci."},{"key":"129_CR13","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana, 7, 1\u201322 (1906) (Reprinted in Selected Mathematical Papers of Axel, T., Nagell, T. (eds.) pp. 139\u2013158. Universitetsforlaget, Oslo, Norway (1977))"},{"key":"129_CR14","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana, 1, 1\u201367 (1912) (Reprinted in Selected Mathematical Papers of Axel, T., Nagell, T. (eds) pp. 413\u2013478. Universitetsforlaget, Oslo, Norway (1977))"},{"issue":"2","key":"129_CR15","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1070\/SM1984v047n02ABEH002647","volume":"47","author":"A.I. Zimin","year":"1984","unstructured":"Zimin A.I.: Blocking sets of terms. Mathematics of the USSR-Sbornik 47(2), 353\u2013364 (1984)","journal-title":"Mathematics of the USSR-Sbornik"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-010-0129-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-010-0129-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-010-0129-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,6]],"date-time":"2019-06-06T22:50:26Z","timestamp":1559861426000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-010-0129-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,12,10]]},"references-count":15,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,2]]}},"alternative-id":["129"],"URL":"https:\/\/doi.org\/10.1007\/s00236-010-0129-0","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"value":"0001-5903","type":"print"},{"value":"1432-0525","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,12,10]]}}}