{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T16:54:08Z","timestamp":1725555248836},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642130885"},{"type":"electronic","value":"9783642130892"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2010]]},"DOI":"10.1007\/978-3-642-13089-2_8","type":"book-chapter","created":{"date-parts":[[2010,5,7]],"date-time":"2010-05-07T08:05:27Z","timestamp":1273219527000},"page":"94-105","source":"Crossref","is-referenced-by-count":2,"title":["Abelian Square-Free Partial Words"],"prefix":"10.1007","author":[{"given":"Francine","family":"Blanchet-Sadri","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jane I.","family":"Kim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert","family":"Merca\u015f","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"William","family":"Severa","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sean","family":"Simmons","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"8_CR1","unstructured":"Berstel, J.: Axel Thue\u2019s work on repetitions in words. In: Leroux, P., Reutenauer, C. (eds.) Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics, pp. 65\u201380 (1992)"},{"key":"8_CR2","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":"8_CR3","doi-asserted-by":"crossref","unstructured":"Blanchet-Sadri, F.: Algorithmic Combinatorics on Partial Words. Chapman & Hall\/CRC Press (2008)","DOI":"10.1201\/9781420060935"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1007\/978-3-642-00982-2_16","volume-title":"Language and Automata Theory and Applications","author":"F. Blanchet-Sadri","year":"2009","unstructured":"Blanchet-Sadri, F., Merca\u015f, R., Rashin, A., Willett, E.: An answer to a conjecture on overlaps in partial words using periodicity algorithms. In: Dediu, A.H., Ionescu, A.M., Mart\u00edn-Vide, C. (eds.) LATA 2009. LNCS, vol.\u00a05457, pp. 188\u2013199. Springer, Heidelberg (2009)"},{"issue":"8-10","key":"8_CR5","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":"8_CR6","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(1-3), 155\u2013167 (1998)","journal-title":"Discrete Applied Mathematics"},{"key":"8_CR7","doi-asserted-by":"crossref","unstructured":"Cummings, L.J., Mays, M.: A one-sided Zimin construction. The Electronic Journal of Combinatorics\u00a08 (2001)","DOI":"10.37236\/1571"},{"issue":"2","key":"8_CR8","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0097-3165(79)90044-X","volume":"27","author":"F. Dekking","year":"1979","unstructured":"Dekking, F.: Strongly non-repetitive sequences and progression-free sets. Journal of Combinatorial Theory\u00a027(2), 181\u2013185 (1979)","journal-title":"Journal of Combinatorial Theory"},{"key":"8_CR9","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\u00a06, 221\u2013254 (1961)","journal-title":"Magyar Tudom\u00e1nyos Akad\u00e9mia Matematikai Kutat\u00f3 Int\u00e9zete"},{"key":"8_CR10","first-page":"1268","volume":"179","author":"A. Evdokimov","year":"1968","unstructured":"Evdokimov, A.: Strongly asymmetric sequences generated by a finite number of symbols. Doklady Akademii Nauk SSSR\u00a0179, 1268\u20131271 (1968) (in Russian); English translation in Soviet mathematics - Doklady\u00a09, 536\u2013539 (1968)","journal-title":"Doklady Akademii Nauk SSSR"},{"key":"8_CR11","first-page":"25","volume":"18","author":"A. Evdokimov","year":"1971","unstructured":"Evdokimov, A.: The existence of a basis that generates 7-valued iteration-free sequences. Diskretny\u01d0 Analiz\u00a018, 25\u201330 (1971)","journal-title":"Diskretny\u01d0 Analiz"},{"issue":"5","key":"8_CR12","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1016\/j.ipl.2008.06.001","volume":"108","author":"V. Halava","year":"2008","unstructured":"Halava, V., Harju, T., K\u00e4rki, T.: Square-free partial words. Information Processing Letters\u00a0108(5), 290\u2013292 (2008)","journal-title":"Information Processing Letters"},{"issue":"8-10","key":"8_CR13","doi-asserted-by":"publisher","first-page":"943","DOI":"10.1016\/j.tcs.2008.12.041","volume":"410","author":"V. Halava","year":"2009","unstructured":"Halava, V., Harju, T., K\u00e4rki, T., S\u00e9\u00e9bold, P.: Overlap-freeness in infinite partial words. Theoretical Computer Science\u00a0410(8-10), 943\u2013948 (2009)","journal-title":"Theoretical Computer Science"},{"key":"8_CR14","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":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","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":"8_CR16","unstructured":"Ker\u00e4nen, V.: New abelian square-free DT0L-languages over 4 letters. In: Proceedings of the Fifth International Arctic Seminar, Murmansk, Russia. Murmansk State Pedagogical Institute (2002)"},{"issue":"38-40","key":"8_CR17","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(38-40), 3893\u20133900 (2009)","journal-title":"Theoretical Computer Science"},{"key":"8_CR18","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. Journal of Combinatorial Theory, Series A\u00a0102, 207\u2013211 (2003)","journal-title":"Journal of Combinatorial Theory, Series A"},{"issue":"1-2","key":"8_CR19","doi-asserted-by":"crossref","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"},{"key":"8_CR20","doi-asserted-by":"publisher","first-page":"267","DOI":"10.1017\/S0305004100046077","volume":"68","author":"P. Pleasants","year":"1970","unstructured":"Pleasants, P.: Non repetitive sequences. Proceedings of the Cambridge Philosophical Society\u00a068, 267\u2013274 (1970)","journal-title":"Proceedings of the Cambridge Philosophical Society"},{"key":"8_CR21","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); Nagell, T. (ed.), Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 139\u2013158 (1977)","journal-title":"Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"8_CR22","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); Nagell, T. (ed.) Reprinted in Selected Mathematical Papers of Axel Thue, Universitetsforlaget, Oslo, Norway, pp. 413\u2013478 (1977)","journal-title":"Norske Vid. Selsk. Skr. I, Mat. Nat. Kl. Christiana"},{"key":"8_CR23","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-13089-2_8.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,23]],"date-time":"2020-11-23T22:01:05Z","timestamp":1606168865000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-13089-2_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010]]},"ISBN":["9783642130885","9783642130892"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-13089-2_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2010]]}}}