{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T23:30:16Z","timestamp":1725579016506},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642192210"},{"type":"electronic","value":"9783642192227"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19222-7_6","type":"book-chapter","created":{"date-parts":[[2011,3,14]],"date-time":"2011-03-14T08:03:12Z","timestamp":1300089792000},"page":"43-55","source":"Crossref","is-referenced-by-count":0,"title":["Minimum Number of Holes in Unavoidable Sets of Partial Words of Size Three"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Bob","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Aleksandar","family":"Chakarov","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"6_CR1","doi-asserted-by":"publisher","first-page":"311","DOI":"10.1016\/0304-3975(82)90124-4","volume":"27","author":"A. Ehrenfeucht","year":"1983","unstructured":"Ehrenfeucht, A., Haussler, D., Rozenberg, G.: On regularity of context-free languages. Theoretical Computer Science\u00a027, 311\u2013332 (1983)","journal-title":"Theoretical Computer Science"},{"key":"6_CR2","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1142\/S0218196704001700","volume":"14","author":"J.M. Champarnaud","year":"2004","unstructured":"Champarnaud, J.M., Hansel, G., Perrin, D.: Unavoidable sets of constant length. International Journal of Algebra and Computation\u00a014, 241\u2013251 (2004)","journal-title":"International Journal of Algebra and Computation"},{"key":"6_CR3","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1016\/0020-0190(83)90119-9","volume":"16","author":"M. Crochemore","year":"1983","unstructured":"Crochemore, M., Le Rest, M., Wender, P.: An optimal test on finite unavoidable sets of words. Information Processing Letters\u00a016, 179\u2013180 (1983)","journal-title":"Information Processing Letters"},{"key":"6_CR4","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/0166-218X(84)90014-3","volume":"9","author":"C. Choffrut","year":"1984","unstructured":"Choffrut, C., Culik II, K.: On extendibility of unavoidable sets. Discrete Applied Mathematics\u00a09, 125\u2013137 (1984)","journal-title":"Discrete Applied Mathematics"},{"key":"6_CR5","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jcta.2003.12.003","volume":"105","author":"A. Evdokimov","year":"2004","unstructured":"Evdokimov, A., Kitaev, S.: Crucial words and the complexity of some extremal problems for sets of prohibited words. Journal of Combinatorial Theory, Series A\u00a0105, 273\u2013289 (2004)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"6_CR6","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/j.tcs.2006.03.024","volume":"359","author":"P.M. Higgins","year":"2006","unstructured":"Higgins, P.M., Saker, C.J.: Unavoidable sets. Theoretical Computer Science\u00a0359, 231\u2013238 (2006)","journal-title":"Theoretical Computer Science"},{"key":"6_CR7","doi-asserted-by":"crossref","first-page":"339","DOI":"10.1051\/ita\/1995290503391","volume":"29","author":"L. Rosaz","year":"1995","unstructured":"Rosaz, L.: Unavoidable languages, cuts and innocent sets of words. RAIRO-Theoretical Informatics and Applications\u00a029, 339\u2013382 (1995)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"6_CR8","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/S0304-3975(97)00031-5","volume":"201","author":"L. Rosaz","year":"1998","unstructured":"Rosaz, L.: Inventories of unavoidable languages and the word-extension conjecture. Theoretical Computer Science\u00a0201, 151\u2013170 (1998)","journal-title":"Theoretical Computer Science"},{"key":"6_CR9","doi-asserted-by":"publisher","first-page":"222","DOI":"10.1006\/inco.2001.3123","volume":"173","author":"C.J. Saker","year":"2002","unstructured":"Saker, C.J., Higgins, P.M.: Unavoidable sets of words of uniform length. Information and Computation\u00a0173, 222\u2013226 (2002)","journal-title":"Information and Computation"},{"key":"6_CR10","doi-asserted-by":"publisher","first-page":"968","DOI":"10.1016\/j.tcs.2008.11.011","volume":"410","author":"F. Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Jungers, R.M., Palumbo, J.: Testing avoidability on sets of partial words is hard. Theoretical Computer Science\u00a0410, 968\u2013972 (2009)","journal-title":"Theoretical Computer Science"},{"key":"6_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1007\/978-3-642-02737-6_9","volume-title":"Developments in Language Theory","author":"B. Blakeley","year":"2009","unstructured":"Blakeley, B., Blanchet-Sadri, F., Gunter, J., Rampersad, N.: On the complexity of deciding avoidability of sets of partial words. In: Diekert, V., Nowotka, D. (eds.) DLT 2009. LNCS, vol.\u00a05583, pp. 113\u2013124. Springer, Heidelberg (2009)"},{"key":"6_CR12","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of Words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Berlin (1997)"},{"key":"6_CR13","doi-asserted-by":"publisher","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":"6_CR14","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1007\/s00224-008-9106-1","volume":"45","author":"F. Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Brownstein, N.C., Kalcic, A., Palumbo, J., Weyand, T.: Unavoidable sets of partial words. Theory of Computing Systems\u00a045, 381\u2013406 (2009)","journal-title":"Theory of Computing Systems"},{"key":"6_CR15","series-title":"Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory","doi-asserted-by":"publisher","first-page":"59","DOI":"10.1142\/9781848165458_0002","volume-title":"Scientific Applications of Language Methods","author":"F. Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Blakeley, B., Gunter, J., Simmons, S., Weissenstein, E.: Classifying All Avoidable Sets of Partial Words of Size Two. In: Mart\u00edn-Vide, C. (ed.) Scientific Applications of Language Methods. Mathematics, Computing, Language, and Life: Frontiers in Mathematical Linguistics and Language Theory, pp. 59\u2013101. Imperial College Press, London (2010)"},{"key":"6_CR16","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)"},{"key":"6_CR17","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1016\/S0019-9958(64)90232-3","volume":"7","author":"M.P. Sch\u00fctzenberger","year":"1964","unstructured":"Sch\u00fctzenberger, M.P.: On the synchronizing properties of certain prefix codes. Information and Control\u00a07, 23\u201336 (1964)","journal-title":"Information and Control"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1016\/0095-8956(72)90006-8","volume":"13","author":"J. Mykkeltveit","year":"1972","unstructured":"Mykkeltveit, J.: A proof of Golomb\u2019s conjecture for the de Bruijn graph. Journal of Combinatorial Theory, Series B\u00a013, 40\u201345 (1972)","journal-title":"Journal of Combinatorial Theory, Series B"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19222-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T10:29:25Z","timestamp":1558434565000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19222-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642192210","9783642192227"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19222-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}