{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:03:50Z","timestamp":1725595430145},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642223204"},{"type":"electronic","value":"9783642223211"}],"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-22321-1_7","type":"book-chapter","created":{"date-parts":[[2011,7,14]],"date-time":"2011-07-14T23:58:48Z","timestamp":1310687928000},"page":"70-81","source":"Crossref","is-referenced-by-count":2,"title":["Avoiding Abelian Powers in Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"7_CR1","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.tcs.2008.09.027","volume":"410","author":"A. Aberkane","year":"2009","unstructured":"Aberkane, A., Currie, J.: A cyclic binary morphism avoiding abelian fourth powers. Theoretical Computer Science\u00a0410, 44\u201352 (2009)","journal-title":"Theoretical Computer Science"},{"key":"7_CR2","first-page":"13","volume":"7","author":"A. Aberkane","year":"2004","unstructured":"Aberkane, A., Currie, J., Rampersad, N.: The number of ternary words avoiding abelian cubes grows exponentially. Journal of Integer Sequences\u00a07, Article 04.2.7, 13 (2004) (electronic)","journal-title":"Journal of Integer Sequences"},{"key":"7_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1007\/978-3-540-78967-3_16","volume-title":"Advances in Cryptology \u2013 EUROCRYPT 2008","author":"E. Andreeva","year":"2008","unstructured":"Andreeva, E., Bouillaguet, C., Fouque, P.A., Hoch, J., Kelsey, J., Shamir, A., Zimmer, S.: Second preimage attacks on dithered hash functions. In: Smart, N. (ed.) EUROCRYPT 2008. LNCS, vol.\u00a04965, pp. 270\u2013288. Springer, Heidelberg (2008)"},{"key":"7_CR4","doi-asserted-by":"publisher","first-page":"135","DOI":"10.1016\/S0304-3975(98)00255-2","volume":"218","author":"J. Berstel","year":"1999","unstructured":"Berstel, J., Boasson, L.: Partial words and a theorem of Fine and Wilf. Theoretical Computer Science\u00a0218, 135\u2013141 (1999)","journal-title":"Theoretical Computer Science"},{"key":"7_CR5","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, FL (2008)"},{"key":"7_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"94","DOI":"10.1007\/978-3-642-13089-2_8","volume-title":"Language and Automata Theory and Applications","author":"F. Blanchet-Sadri","year":"2010","unstructured":"Blanchet-Sadri, F., Kim, J.I., Merca\u015f, R., Severa, W., Simmons, S.: Abelian square-free partial words. In: Dediu, A.H., Fernau, H., Mart\u00edn-Vide, C. (eds.) LATA 2010. LNCS, vol.\u00a06031, pp. 94\u2013105. Springer, Heidelberg (2010)"},{"key":"7_CR7","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, 793\u2013800 (2009)","journal-title":"Theoretical Computer Science"},{"key":"7_CR8","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 Applied Mathematics\u00a081, 155\u2013167 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"7_CR9","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1016\/S0304-3975(98)00250-3","volume":"218","author":"A. Carpi","year":"1999","unstructured":"Carpi, A.: On abelian squares and substitutions. Theoretical Computer Science\u00a0218, 61\u201381 (1999)","journal-title":"Theoretical Computer Science"},{"key":"7_CR10","doi-asserted-by":"publisher","first-page":"509","DOI":"10.1051\/ita\/1990240605091","volume":"24","author":"R. Cori","year":"1990","unstructured":"Cori, R., Formisano, M.: Partially abelian square-free words. RAIRO-Theoretical Informatics and Applications\u00a024, 509\u2013520 (1990)","journal-title":"RAIRO-Theoretical Informatics and Applications"},{"key":"7_CR11","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1016\/j.tcs.2004.02.005","volume":"319","author":"J. Currie","year":"2004","unstructured":"Currie, J.: The number of binary words avoiding abelian fourth powers grows exponentially. Theoretical Computer Science\u00a0319, 441\u2013446 (2004)","journal-title":"Theoretical Computer Science"},{"key":"7_CR12","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 non-repetitive sequences and progression-free sets. Journal of Combinatorial Theory, Series A\u00a027, 181\u2013185 (1979)","journal-title":"Journal of Combinatorial Theory, Series A"},{"key":"7_CR13","first-page":"479","volume":"40","author":"V. Diekert","year":"1990","unstructured":"Diekert, V.: Research topics in the theory of free partially commutative monoids. Bulletin of the European Association for Theoretical Computer Science\u00a040, 479\u2013491 (1990)","journal-title":"Bulletin of the European Association for Theoretical Computer Science"},{"key":"7_CR14","first-page":"221","volume":"6","author":"P. Erd\u00f6s","year":"1961","unstructured":"Erd\u00f6s, P.: Some unsolved problems. Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete K\u00f6zl\u00a06, 221\u2013254 (1961)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete K\u00f6zl"},{"key":"7_CR15","first-page":"536","volume":"9","author":"A.A. Evdokimov","year":"1968","unstructured":"Evdokimov, A.A.: Strongly asymmetric sequences generated by a finite number of symbols. Doklady Mathematics\u00a09, 536\u2013539 (1968)","journal-title":"Doklady Mathematics"},{"key":"7_CR16","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0021-8693(72)90036-1","volume":"21","author":"J. Justin","year":"1972","unstructured":"Justin, J.: Characterization of the repetitive commutative semigroups. Journal of Algebra\u00a021, 87\u201390 (1972)","journal-title":"Journal of Algebra"},{"key":"7_CR17","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":"7_CR18","doi-asserted-by":"publisher","first-page":"3893","DOI":"10.1016\/j.tcs.2009.05.027","volume":"410","author":"V. Ker\u00e4nen","year":"2009","unstructured":"Ker\u00e4nen, V.: A powerful abelian square-free substitution over 4 letters. Theoretical Computer Science\u00a0410, 3893\u20133900 (2009)","journal-title":"Theoretical Computer Science"},{"key":"7_CR19","first-page":"292","volume-title":"Logic, Mathematics and the Computer","author":"T. Laakso","year":"1996","unstructured":"Laakso, T.: Musical rendering of an infinite repetition-free string. In: Gefwert, C., Orponen, P., Sepp\u00e4nen, J. (eds.) Logic, Mathematics and the Computer, vol.\u00a014, pp. 292\u2013297. Finnish Artificial Intelligence Society, Symposiosarja, Hakapaino, Helsinki (1996)"},{"key":"7_CR20","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":"7_CR21","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. Proceedings of the Cambridge Philosophical Society\u00a068, 267\u2013274 (1970)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"7_CR22","volume-title":"Abelian square-free dithering for iterated hash functions","author":"R.L. Rivest","year":"2005","unstructured":"Rivest, R.L.: Abelian square-free dithering for iterated hash functions. MIT, Cambridge (2005), \n                    \n                      http:\/\/people.csail.mit.edu\/rivest\/publications.html"},{"key":"7_CR23","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"}],"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-22321-1_7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,29]],"date-time":"2019-03-29T22:55:27Z","timestamp":1553900127000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22321-1_7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642223204","9783642223211"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22321-1_7","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}