{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:25:29Z","timestamp":1725456329639},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540634379"},{"type":"electronic","value":"9783540695479"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1997]]},"DOI":"10.1007\/bfb0029978","type":"book-chapter","created":{"date-parts":[[2005,12,1]],"date-time":"2005-12-01T06:24:59Z","timestamp":1133418299000},"page":"347-357","source":"Crossref","is-referenced-by-count":3,"title":["Minimal letter frequency in n-th power-free binary words"],"prefix":"10.1007","author":[{"given":"Roman","family":"Kolpakov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gregory","family":"Kucherov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2005,6,17]]},"reference":[{"issue":"3","key":"35_CR1","first-page":"363","volume":"119","author":"A. \u0418. 3\u0438M\u0438H","year":"1982","unstructured":"A. \u0418. 3\u0438M\u0438H. \u0411\u043boK\u0438py\u044e\u0449e MHO\u0436eCTBa Te\u0440\u043co\u0432. Mame\u043camuvecxu6 C6opvcux, 119(3):363\u2013375, 1982. English Translation: A.I.Zimin, Blocking sets of terms, Math. USSR Sbornik 47 (1984), 353\u2013364.","journal-title":"Mame\u043camuvecxu6 C6opvcux"},{"key":"35_CR2","first-page":"7","volume":"39","author":"A.A. EBIIOKHMOB","year":"1983","unstructured":"A.A. EBIIOKHMOB. Iloambie MHoxceCTSa c.nos H rix-Hcaiosaie xapaKTepuCTHKH. In Memodbi ductcpemnoeo aacaAuda e uccaedoeanuu axcmpe.naAbHbax cmpyxmyp, volume 39, pages 7\u201319, Hosocri6xpcx, 1983.","journal-title":"Memodbi ductcpemnoeo aacaAuda e uccaedoeanuu axcmpe.naAbHbax cmpyxmyp"},{"key":"35_CR3","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1016\/0304-3975(89)90071-6","volume":"69","author":"K. Baker","year":"1989","unstructured":"K. Baker, G. McNulty, and W. Taylor. Growth problems for avoidable words. Theoret. Comp. Sci., 69:319\u2013345, 1989.","journal-title":"Theoret. Comp. Sci."},{"issue":"2","key":"35_CR4","doi-asserted-by":"crossref","first-page":"261","DOI":"10.2140\/pjm.1979.85.261","volume":"85","author":"D. Bean","year":"1979","unstructured":"D. Bean, A. Ehrenfeucht, and G. McNulty. Avoidable patterns in strings of symbols. Pacific J. Math., 85(2):261\u2013294, 1979.","journal-title":"Pacific J. Math."},{"key":"35_CR5","unstructured":"J. Berstel. Axel thue's work on repetitions in words. Invited Lecture at the 4th Conference on Formal Power Series and Algebraic Combinatorics, Montreal, 1992, June 1992. accessible at http:\/\/www-litp. ibp.fr:80\/berstel\/."},{"key":"35_CR6","unstructured":"J. Berstel and D. Perrin. Theory of codes. Academic Press, 1985."},{"key":"35_CR7","unstructured":"J. Cassaigne. Motifs \u00e9vitables et r\u00e9gularit\u00e9s dans les mots. These de doctorat, Universit\u00e9 Paris VI, 1994."},{"issue":"4","key":"35_CR8","doi-asserted-by":"publisher","first-page":"407","DOI":"10.1142\/S0218196791000286","volume":"1","author":"M. Crochemore","year":"1991","unstructured":"M. Crochemore and P. Goralcik. Mutually avoiding ternary words of small exponent. International Journal of Algebra and Computation, 1(4):407\u2013410, 1991.","journal-title":"International Journal of Algebra and Computation"},{"key":"35_CR9","doi-asserted-by":"crossref","first-page":"790","DOI":"10.1080\/00029890.1993.11990489","volume":"100","author":"J. Currie","year":"1993","unstructured":"J. Currie. Open problems in pattern avoidance. American Mathematical Monthly, 100:790\u2013793, 1993.","journal-title":"American Mathematical Monthly"},{"key":"35_CR10","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1016\/0097-3165(72)90011-8","volume":"13","author":"F. Dejean","year":"1972","unstructured":"F. Dejean. Sur un th\u00e9or\u00e9me de Thue. J. Combinatorial Th. (A), 13:90\u201399, 1972.","journal-title":"J. Combinatorial Th. (A)"},{"key":"35_CR11","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1051\/ita\/1988220201351","volume":"22","author":"A. Kfoury","year":"1988","unstructured":"A. Kfoury. A linear time algorithm testing whether a word contains an overlap. RAIRO Inf. Th., 22:135\u2013145, 1988.","journal-title":"RAIRO Inf. Th."},{"key":"35_CR12","unstructured":"M. Lothaire. Combinatorics on Words, volume 17 of Encyclopedia of Mathematics and Its Applications. Addison Wesley, 1983."},{"key":"35_CR13","first-page":"49","volume":"21","author":"A. Restivo","year":"1983","unstructured":"A. Restivo and S. Salemi. On weakly square free words. Bull. of the EATCS, 21:49\u201356, 1983.","journal-title":"Bull. of the EATCS"},{"key":"35_CR14","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1007\/BF01178567","volume":"29","author":"P. Roth","year":"1992","unstructured":"P. Roth. Every binary pattern of length six is avoidable on the two-letter alphabet. Acta Informatica, 29:95\u2013106, 1992.","journal-title":"Acta Informatica"},{"key":"35_CR15","unstructured":"A. Salomaa. Jewels of formal language theory. Computer Science Press, 1986."},{"key":"35_CR16","unstructured":"M. Sapir. Combinatorics on words with applications, December 1993. accessible at http:\/\/www.math.unl.edu\/-msapir\/ftp\/course."},{"key":"35_CR17","first-page":"1","volume":"7","author":"A. Thue","year":"1906","unstructured":"A. Thue. \u00dcber unendliche Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania, 7:1\u201322, 1906.","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania"},{"key":"35_CR18","first-page":"1","volume":"10","author":"A. Thue","year":"1912","unstructured":"A. Thue. \u00dcber die gegenseitige Lage gleicher Teile gewisser Zeichenreihen. Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania, 10:1\u201367, 1912.","journal-title":"Norske Vid. Selsk. Skr. I. Mat. Nat. Kl. Christiania"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 1997"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0029978","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,6]],"date-time":"2019-02-06T06:47:58Z","timestamp":1549435678000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0029978"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997]]},"ISBN":["9783540634379","9783540695479"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/bfb0029978","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1997]]}}}