{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:45Z","timestamp":1725555285758},"publisher-location":"Berlin, Heidelberg","reference-count":14,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_9","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T12:05:27Z","timestamp":1273233927000},"page":"106-117","source":"Crossref","is-referenced-by-count":2,"title":["Avoidable Binary Patterns in Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","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","reference":[{"key":"9_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. Pacific Journal of Mathematics\u00a085, 261\u2013294 (1979)","journal-title":"Pacific Journal of Mathematics"},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press (2008)","DOI":"10.1201\/9781420060935"},{"issue":"8-10","key":"9_CR3","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0410(8-10), 793\u2013800 (2009)","journal-title":"Theoretical Computer Science"},{"key":"9_CR4","doi-asserted-by":"publisher","first-page":"385","DOI":"10.1007\/BF01209712","volume":"30","author":"J. Cassaigne","year":"1993","unstructured":"Cassaigne, J.: Unavoidable binary patterns. Acta Informatica\u00a030, 385\u2013395 (1993)","journal-title":"Acta Informatica"},{"issue":"8-10","key":"9_CR5","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a0410(8-10), 943\u2013948 (2009)","journal-title":"Theoretical Computer Science"},{"key":"9_CR6","doi-asserted-by":"publisher","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":"9_CR7","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-2","key":"9_CR8","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. Theoretical Computer Science\u00a0389(1-2), 265\u2013277 (2007)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"9_CR9","doi-asserted-by":"publisher","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\u00a029(1), 95\u2013107 (1992)","journal-title":"Acta Informatica"},{"key":"9_CR10","unstructured":"Schmidt, U.: Motifs in\u00e9vitables dans les mots. Rapport LITP, pp. 86\u201363, Paris VI (1986)"},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","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. Theoretical Computer Science\u00a063(1), 1\u201317 (1989)","journal-title":"Theoretical Computer Science"},{"key":"9_CR12","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana\u00a07, 1\u201322 (1906); Nagell, T. (ed.) Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 139\u2013158 (1977)","journal-title":"Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"9_CR13","first-page":"1","volume":"1","author":"A. Thue","year":"1912","unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana\u00a01, 1\u201367 (1912); Nagell, T. (ed.) Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 413\u2013478 (1977)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"9_CR14","doi-asserted-by":"publisher","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\u00a047, 353\u2013364 (1984)","journal-title":"Mathematics of the USSR Sbornik"}],"container-title":["Lecture Notes in Computer Science","Language and Automata Theory and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-13089-2_9.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:01:06Z","timestamp":1606186866000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}