{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:36:23Z","timestamp":1725730583335},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642387708"},{"type":"electronic","value":"9783642387715"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-38771-5_11","type":"book-chapter","created":{"date-parts":[[2013,6,10]],"date-time":"2013-06-10T02:16:25Z","timestamp":1370830585000},"page":"106-117","source":"Crossref","is-referenced-by-count":0,"title":["Strict Bounds for Pattern Avoidance"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Brent","family":"Woodhouse","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","doi-asserted-by":"publisher","first-page":"1295","DOI":"10.1016\/j.ic.2007.02.004","volume":"205","author":"J. Bell","year":"2007","unstructured":"Bell, J., Goh, T.L.: Exponential lower bounds for the number of words of uniform length avoiding a pattern. Information and Computation\u00a0205, 1295\u20131306 (2007)","journal-title":"Information and Computation"},{"key":"11_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"206","DOI":"10.1007\/978-3-642-35926-2_23","volume-title":"IWOCA 2012","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Lohr, A., Scott, S.: Computing the partial word avoidability indices of ternary patterns. In: Arumugam, S., Smyth, B. (eds.) IWOCA 2012. LNCS, vol.\u00a07643, pp. 206\u2013218. Springer, Heidelberg (2012)"},{"key":"11_CR3","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_CR4","unstructured":"Cassaigne, J.: Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. Ph.D. thesis, Paris VI (1994)"},{"key":"11_CR5","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_CR6","doi-asserted-by":"publisher","first-page":"355","DOI":"10.1080\/10236199908808197","volume":"5","author":"J. Noonan","year":"1999","unstructured":"Noonan, J., Zeilberger, D.: The Goulden-Jackson cluster method: Extensions, applications, and implementations. Journal of Differential Equations and Applications\u00a05, 355\u2013377 (1999)","journal-title":"Journal of Differential Equations and Applications"},{"key":"11_CR7","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_CR8","doi-asserted-by":"crossref","unstructured":"Rampersad, N.: Further applications of a power series method for pattern avoidance. The Electronic Journal of Combinatorics\u00a018, P134 (2011)","DOI":"10.37236\/621"},{"key":"11_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, 95\u2013106 (1992)","journal-title":"Acta Informatica"},{"key":"11_CR10","series-title":"Pure and Applied Mathematics 128","volume-title":"Ring Theory","author":"L. Rowen","year":"1988","unstructured":"Rowen, L.: Ring Theory. Pure and Applied Mathematics 128, vol.\u00a0II. Academic Press, Boston (1988)"}],"container-title":["Lecture Notes in Computer Science","Developments in Language Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-38771-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,28]],"date-time":"2020-07-28T02:16:40Z","timestamp":1595902600000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":10,"URL":"http:\/\/dx.doi.org\/10.1007\/978-3-642-38771-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}
