{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:00:09Z","timestamp":1725534009363},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642027369"},{"type":"electronic","value":"9783642027376"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"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":[[2009]]},"DOI":"10.1007\/978-3-642-02737-6_21","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"264-275","source":"Crossref","is-referenced-by-count":1,"title":["Crucial Words for Abelian Powers"],"prefix":"10.1007","author":[{"given":"Amy","family":"Glen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Bjarni V.","family":"Halld\u00f3rsson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sergey","family":"Kitaev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"21_CR1","doi-asserted-by":"crossref","first-page":"17","DOI":"10.37236\/1770","volume":"11","author":"E.M. Bullock","year":"2004","unstructured":"Bullock, E.M.: Improved bounds on the length of maximal abelian square-free words. Electron. J. Combin.\u00a011, #R17 (2004)","journal-title":"Electron. J. Combin."},{"key":"21_CR2","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(97)88002-X","volume":"81","author":"A. Carpi","year":"1998","unstructured":"Carpi, A.: On the number of abelian square-free words on four letters. Discrete Appl. Math.\u00a081, 155\u2013167 (1998)","journal-title":"Discrete Appl. Math."},{"key":"21_CR3","doi-asserted-by":"crossref","first-page":"27","DOI":"10.37236\/1571","volume":"8","author":"L.J. Cummings","year":"2001","unstructured":"Cummings, L.J., Mays, M.: A one-sided Zimin construction. Electron. J. Combin.\u00a08, #R27 (2001)","journal-title":"Electron. J. Combin."},{"key":"21_CR4","first-page":"221","volume":"6","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P.: Some unsolved problems. Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl.\u00a06, 221\u2013254 (1961)","journal-title":"Magyar Tud. Akad. Mat. Kutat\u00f3 Int. K\u00f6zl."},{"key":"#cr-split#-21_CR5.1","unstructured":"Evdokimov, A.A.: Strongly asymmetric sequences generated by a finite number of symbols. Dokl. Akad. Nauk SSSR 179, 1268\u20131271 (1968);"},{"key":"#cr-split#-21_CR5.2","unstructured":"Soviet Math. Dokl. 9, 536\u2013539 (1968)"},{"key":"21_CR6","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1016\/j.jcta.2003.12.003","volume":"105","author":"A.A. Evdokimov","year":"2004","unstructured":"Evdokimov, A.A., Kitaev, S.: Crucial words and the complexity of some extremal problems for sets of prohibited words. J. Combin. Theory Ser. A\u00a0105, 273\u2013289 (2004)","journal-title":"J. Combin. Theory Ser. A"},{"key":"21_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/3-540-55719-9_62","volume-title":"Automata, Languages and Programming","author":"V. Ker\u00e4nen","year":"1992","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Kuich, W. (ed.) ICALP 1992. LNCS, vol.\u00a0623, pp. 41\u201352. Springer, Heidelberg (1992)"},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"207","DOI":"10.1016\/S0097-3165(03)00016-5","volume":"102","author":"M. Korn","year":"2003","unstructured":"Korn, M.: Maximal abelian square-free words of short length. J. Combin. Theory Ser. A\u00a0102, 207\u2013211 (2003)","journal-title":"J. Combin. Theory Ser. A"},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"P.A.B. Pleasants","year":"1970","unstructured":"Pleasants, P.A.B.: Non-repetitive sequences. Proc. Cambridge Philos. Soc.\u00a068, 267\u2013274 (1970)","journal-title":"Proc. Cambridge Philos. Soc."},{"key":"#cr-split#-21_CR10.1","unstructured":"Zimin, A.: Blocking sets of terms. Mat. Sb (N.S.) 119 (161), 363\u2013375, 447 (1982);"},{"key":"#cr-split#-21_CR10.2","doi-asserted-by":"crossref","unstructured":"Math. USSR Sbornik 47 353\u2013364 (1984)","DOI":"10.1070\/SM1984v047n02ABEH002647"}],"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-02737-6_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,20]],"date-time":"2020-05-20T03:46:10Z","timestamp":1589946370000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}