{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T12:51:14Z","timestamp":1725540674354},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642359255"},{"type":"electronic","value":"9783642359262"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-35926-2_23","type":"book-chapter","created":{"date-parts":[[2012,12,21]],"date-time":"2012-12-21T04:32:11Z","timestamp":1356064331000},"page":"206-218","source":"Crossref","is-referenced-by-count":1,"title":["Computing the Partial Word Avoidability Indices of Ternary Patterns"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Andrew","family":"Lohr","sequence":"additional","affiliation":[]},{"given":"Shane","family":"Scott","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"23_CR1","doi-asserted-by":"publisher","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":"23_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, FL (2008)"},{"key":"23_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.\u00a06638, pp. 155\u2013166. Springer, Heidelberg (2011)"},{"issue":"1","key":"23_CR4","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s00236-010-0129-0","volume":"48","author":"F. Blanchet-Sadri","year":"2011","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Simmons, S., Weissenstein, E.: Avoidable binary patterns in partial words. Acta Informatica\u00a048(1), 25\u201341 (2011)","journal-title":"Acta Informatica"},{"key":"23_CR5","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1007\/s00236-011-0149-4","volume":"49","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Simmons, S., Weissenstein, E.: Erratum to: Avoidable binary patterns in partial words. Acta Informatica\u00a049, 53\u201354 (2012)","journal-title":"Acta Informatica"},{"key":"23_CR6","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"},{"key":"23_CR7","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. PhD thesis, Paris VI (1994)"},{"key":"23_CR8","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1142\/S0218196706002950","volume":"16","author":"R.J. Clark","year":"2006","unstructured":"Clark, R.J.: The existence of a pattern which is 5-avoidable but 4-unavoidable. International Journal of Algebra and Computation\u00a016, 351\u2013367 (2006)","journal-title":"International Journal of Algebra and Computation"},{"key":"23_CR9","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)"},{"key":"23_CR10","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1051\/ita:2006020","volume":"40","author":"P. Ochem","year":"2006","unstructured":"Ochem, P.: A generator of morphisms for infinite words. RAIRO-Theoretical Informatics and Applications\u00a040, 427\u2013441 (2006)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"23_CR11","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","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-35926-2_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,4]],"date-time":"2021-05-04T13:33:50Z","timestamp":1620135230000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-35926-2_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642359255","9783642359262"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-35926-2_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}