{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T00:55:47Z","timestamp":1725584147639},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212536"},{"type":"electronic","value":"9783642212543"}],"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-21254-3_11","type":"book-chapter","created":{"date-parts":[[2011,5,27]],"date-time":"2011-05-27T05:38:04Z","timestamp":1306474684000},"page":"155-166","source":"Crossref","is-referenced-by-count":6,"title":["Unary Pattern Avoidance in Partial Words Dense with Holes"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kevin","family":"Black","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andrew","family":"Zemke","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546563","volume-title":"Automatic Sequences: Theory, Applications, Generalizations","author":"J.P. Allouche","year":"2003","unstructured":"Allouche, J.P., Shallit, J.: Automatic Sequences: Theory, Applications, Generalizations. Cambridge University Press, Cambridge (2003)"},{"key":"11_CR2","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":"11_CR3","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":"11_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, 25\u201341 (2011)","journal-title":"Acta Informatica"},{"key":"11_CR5","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":"11_CR6","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. PhD thesis, Paris VI (1994)"},{"key":"11_CR7","doi-asserted-by":"publisher","first-page":"5227","DOI":"10.1016\/j.tcs.2009.08.024","volume":"410","author":"M. Crochemore","year":"2009","unstructured":"Crochemore, M., Ilie, L., Rytter, W.: Repetitions in strings: Algorithms and combinatorics. Theoretical Computer Science\u00a0410, 5227\u20135235 (2009)","journal-title":"Theoretical Computer Science"},{"key":"11_CR8","doi-asserted-by":"crossref","unstructured":"Currie, J.D.: Pattern avoidance: themes and variations. Theoretical Computer Science\u00a0339 (2005)","DOI":"10.1016\/j.tcs.2005.01.004"},{"key":"11_CR9","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":"11_CR10","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":"11_CR11","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(87)90003-X","volume":"49","author":"M.G. Main","year":"1987","unstructured":"Main, M.G., Bucher, W., Haussler, D.: Applications of an infinite squarefree co-CFL. Theoretical Computer Science\u00a049, 113\u2013119 (1987)","journal-title":"Theoretical Computer Science"},{"key":"11_CR12","doi-asserted-by":"publisher","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, 265\u2013277 (2007)","journal-title":"Theoretical Computer Science"},{"key":"11_CR13","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":"11_CR14","doi-asserted-by":"publisher","first-page":"633","DOI":"10.1142\/S0129054108005863","volume":"19","author":"P. Ochem","year":"2008","unstructured":"Ochem, P., Rampersad, N., Shallit, J.: Avoiding aproximate squares. International Journal of Foundations of Computer Science\u00a019, 633\u2013648 (2008)","journal-title":"International Journal of Foundations of Computer Science"},{"key":"11_CR15","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1016\/S0304-3975(00)00437-0","volume":"273","author":"G. Richomme","year":"2002","unstructured":"Richomme, G., Wlazinski, F.: Some results on k-power-free morphisms. Theoretical Computer Science\u00a0273, 119\u2013142 (2002)","journal-title":"Theoretical Computer Science"},{"key":"11_CR16","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, 95\u2013106 (1992)","journal-title":"Acta Informatica"},{"key":"11_CR17","unstructured":"Schmidt, U.: Motifs in\u00e9vitables dans les mots. Technical Report LITP 86\u201363 Th\u00e8se, Paris VI (1986)"},{"key":"11_CR18","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\u201317 (1989)","journal-title":"Theoretical Computer Science"},{"key":"11_CR19","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)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"11_CR20","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)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"11_CR21","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-21254-3_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T19:45:10Z","timestamp":1553715910000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21254-3_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212536","9783642212543"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21254-3_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}