{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T17:35:52Z","timestamp":1725730552037},"publisher-location":"Berlin, Heidelberg","reference-count":18,"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_33","type":"book-chapter","created":{"date-parts":[[2013,6,9]],"date-time":"2013-06-09T22:16:25Z","timestamp":1370816185000},"page":"374-383","source":"Crossref","is-referenced-by-count":5,"title":["3-Abelian Cubes Are Avoidable on Binary Alphabets"],"prefix":"10.1007","author":[{"given":"Robert","family":"Merca\u015f","sequence":"first","affiliation":[]},{"given":"Aleksi","family":"Saarela","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"1","key":"33_CR1","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/j.jcta.2011.08.008","volume":"119","author":"F. Blanchet-Sadri","year":"2012","unstructured":"Blanchet-Sadri, F., Kim, J.I., Merca\u015f, R., Severa, W., Simmons, S., Xu, D.: Avoiding abelian squares in partial words. Journal of Combinatorial Theory. Series A\u00a0119(1), 257\u2013270 (2012)","journal-title":"Journal of Combinatorial Theory. Series A"},{"issue":"8-10","key":"33_CR2","doi-asserted-by":"publisher","first-page":"793","DOI":"10.1016\/j.tcs.2008.11.006","volume":"410","author":"F. Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Scott, G.: A generalization of Thue freeness for partial words. Theoretical Computer Science\u00a0410(8-10), 793\u2013800 (2009)","journal-title":"Theoretical Computer Science"},{"issue":"1-3","key":"33_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1016\/j.tcs.2007.06.001","volume":"385","author":"A. Carpi","year":"2007","unstructured":"Carpi, A.: On Dejean\u2019s conjecture over large alphabets. Theoretical Computer Science\u00a0385(1-3), 137\u2013151 (2007)","journal-title":"Theoretical Computer Science"},{"key":"33_CR4","doi-asserted-by":"publisher","first-page":"1063","DOI":"10.1090\/S0025-5718-2010-02407-X","volume":"80","author":"J. Currie","year":"2011","unstructured":"Currie, J., Rampersad, N.: A proof of Dejean\u2019s conjecture. Mathematics of Computation\u00a080, 1063\u20131070 (2011)","journal-title":"Mathematics of Computation"},{"issue":"2","key":"33_CR5","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"F.M. Dekking","year":"1979","unstructured":"Dekking, F.M.: Strongly nonrepetitive sequences and progression-free sets. Journal of Combinatorial Theory. Series A\u00a027(2), 181\u2013185 (1979)","journal-title":"Journal of Combinatorial Theory. Series A"},{"key":"33_CR6","first-page":"221","volume":"6","author":"P. Erd\u0151s","year":"1961","unstructured":"Erd\u0151s, P.: Some unsolved problems. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete\u00a06, 221\u2013254 (1961)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete"},{"unstructured":"Huova, M., Karhum\u00e4ki, J.: On the unavoidability of k-abelian squares in pure morphic words. Journal of Integer Sequences\u00a016(2) (2013)","key":"33_CR7"},{"key":"33_CR8","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.tcs.2012.03.010","volume":"454","author":"M. Huova","year":"2012","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A.: Problems in between words and abelian words: k-abelian avoidability. Theoretical Computer Science\u00a0454, 172\u2013177 (2012)","journal-title":"Theoretical Computer Science"},{"key":"33_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-19391-0_7","volume-title":"Rainbow of Computer Science","author":"M. Huova","year":"2011","unstructured":"Huova, M., Karhum\u00e4ki, J., Saarela, A., Saari, K.: Local squares, periodicity and finite automata. In: Calude, C.S., Rozenberg, G., Salomaa, A. (eds.) Rainbow of Computer Science. LNCS, vol.\u00a06570, pp. 90\u2013101. Springer, Heidelberg (2011)"},{"key":"33_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1007\/978-3-642-31653-1_27","volume-title":"Developments in Language Theory","author":"J. Karhum\u00e4ki","year":"2012","unstructured":"Karhum\u00e4ki, J., Puzynina, S., Saarela, A.: Fine and Wilf\u2019s theorem for k-abelian periods. In: Yen, H.-C., Ibarra, O.H. (eds.) DLT 2012. LNCS, vol.\u00a07410, pp. 296\u2013307. Springer, Heidelberg (2012)"},{"doi-asserted-by":"crossref","unstructured":"Ker\u00e4nen, V.: Abelian squares are avoidable on 4 letters. In: Proceedings of the 19th International Colloquium on Automata, Languages and Programming, pp. 41\u201352 (1992)","key":"33_CR11","DOI":"10.1007\/3-540-55719-9_62"},{"issue":"1-2","key":"33_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(1-2), 265\u2013277 (2007)","journal-title":"Theoretical Computer Science"},{"unstructured":"Mercas, R., Saarela, A.: 5-abelian cubes are avoidable on binary alphabets. In: Proceedings of the 14th Mons Days of Theoretical Computer Science (2012)","key":"33_CR13"},{"issue":"27","key":"33_CR14","doi-asserted-by":"publisher","first-page":"3010","DOI":"10.1016\/j.tcs.2010.06.020","volume":"412","author":"M. Rao","year":"2011","unstructured":"Rao, M.: Last cases of Dejean\u2019s conjecture. Theoretical Computer Science\u00a0412(27), 3010\u20133018 (2011)","journal-title":"Theoretical Computer Science"},{"unstructured":"Thue, A.: \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiania 7, 1-22 (1906)","key":"#cr-split#-33_CR15.1"},{"unstructured":"Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, Norway, pp.\u00a0139-158 (1977)","key":"#cr-split#-33_CR15.2"},{"unstructured":"Thue, A.: \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiania 1, 1-67 (1912)","key":"#cr-split#-33_CR16.1"},{"unstructured":"Reprinted in Selected Mathematical Papers of Axel Thue. Nagell, T. (ed.) Universitetsforlaget, Oslo, Norway, pp.\u00a0413-478 (1977)","key":"#cr-split#-33_CR16.2"}],"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_33","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T20:22:46Z","timestamp":1557778966000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-38771-5_33"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642387708","9783642387715"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-38771-5_33","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}