{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:00:07Z","timestamp":1725534007038},"publisher-location":"Berlin, Heidelberg","reference-count":15,"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_14","type":"book-chapter","created":{"date-parts":[[2009,6,30]],"date-time":"2009-06-30T12:40:30Z","timestamp":1246365630000},"page":"183-194","source":"Crossref","is-referenced-by-count":2,"title":["An Extension of the Lyndon Sch\u00fctzenberger Result to Pseudoperiodic Words"],"prefix":"10.1007","author":[{"given":"Elena","family":"Czeizler","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eugen","family":"Czeizler","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lila","family":"Kari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shinnosuke","family":"Seki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"5187","key":"14_CR1","doi-asserted-by":"publisher","first-page":"1021","DOI":"10.1126\/science.7973651","volume":"266","author":"L.M. Adleman","year":"1994","unstructured":"Adleman, L.M.: Molecular computation of solutions to combinatorial problems. Science\u00a0266(5187), 1021\u20131024 (1994)","journal-title":"Science"},{"key":"14_CR2","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546853","volume-title":"Algorithms on Strings","author":"M. Crochemore","year":"2007","unstructured":"Crochemore, M., Hancart, C., Lecroq, T.: Algorithms on Strings. Cambridge University Press, Cambridge (2007)"},{"key":"14_CR3","doi-asserted-by":"publisher","DOI":"10.1142\/4838","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2002","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2002)"},{"key":"14_CR4","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1007\/978-3-642-59136-5_6","volume-title":"Handbook of Formal Languages","author":"C. Choffrut","year":"1997","unstructured":"Choffrut, C., Karhum\u00e4ki, J.: Combinatorics of words. In: Rozenberg, G., Salomaa, A. (eds.) Handbook of Formal Languages, vol.\u00a01, pp. 329\u2013438. Springer, Heidelberg (1997)"},{"key":"14_CR5","series-title":"Encyclopedia of Mathematics and its Applications","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M.: Combinatorics on Words. Encyclopedia of Mathematics and its Applications, vol.\u00a017. Addison-Wesley, Reading (1983)"},{"key":"14_CR6","first-page":"33","volume":"24","author":"L.J. Cummings","year":"1997","unstructured":"Cummings, L.J., Smyth, W.F.: Weak repetitions in strings. Journal of Combinatorial Mathematics and Combinatorial Computing\u00a024, 33\u201348 (1997)","journal-title":"Journal of Combinatorial Mathematics and Combinatorial Computing"},{"key":"14_CR7","first-page":"167","volume":"89","author":"S. Constantinescu","year":"2006","unstructured":"Constantinescu, S., Ilie, L.: Fine and Wilf\u2019s theorem for Abelian periods. Bulletin of the EATCS\u00a089, 167\u2013170 (2006)","journal-title":"Bulletin of the EATCS"},{"key":"14_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/978-3-540-85238-4_21","volume-title":"Mathematical Foundations of Computer Science 2008","author":"E. Czeizler","year":"2008","unstructured":"Czeizler, E., Kari, L., Seki, S.: On a special class of primitive words. In: Ochma\u0144ski, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol.\u00a05162, pp. 265\u2013277. Springer, Heidelberg (2008)"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1307\/mmj\/1028998766","volume":"9","author":"R.C. Lyndon","year":"1962","unstructured":"Lyndon, R.C., Sch\u00fctzenberger, M.P.: The equation a\n                  \n                    m\n                  \u2009=\u2009b\n                  \n                    n\n                  \n                  c\n                  \n                    p\n                   in a free group. Michigan Mathematical Journal\u00a09, 289\u2013298 (1962)","journal-title":"Michigan Mathematical Journal"},{"key":"14_CR10","doi-asserted-by":"publisher","first-page":"488","DOI":"10.1007\/s00233-003-0028-6","volume":"68","author":"T. Harju","year":"2004","unstructured":"Harju, T., Nowotka, D.: The equation x\n                  \n                    i\n                  \u2009=\u2009y\n                  \n                    j\n                  \n                  z\n                  \n                    k\n                   in a free semigroup. Semigroup Forum\u00a068, 488\u2013490 (2004)","journal-title":"Semigroup Forum"},{"issue":"1","key":"14_CR11","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/j.tcs.2004.09.012","volume":"330","author":"T. Harju","year":"2005","unstructured":"Harju, T., Nowotka, D.: On the equation \n                    \n                      \n                    \n                    $x^k = z_1^{k_1} z_2^{k_2} \\ldots z_n^{k_n}$\n                   in a free semigroup. Theoretical Computer Science\u00a0330(1), 117\u2013121 (2005)","journal-title":"Theoretical Computer Science"},{"key":"14_CR12","first-page":"3242","volume":"260","author":"A. Lentin","year":"1965","unstructured":"Lentin, A.: Sur l\u2019\u00e9quation a\n                  \n                    m\n                  \u2009=\u2009b\n                  \n                    n\n                  \n                  c\n                  \n                    p\n                  \n                  d\n                  \n                    q\n                   dans un mono\u00efde libre. Comptes Rendus de l\u2019Acad\u00e9mie des Sciences Paris\u00a0260, 3242\u20133244 (1965)","journal-title":"Comptes Rendus de l\u2019Acad\u00e9mie des Sciences Paris"},{"key":"14_CR13","unstructured":"Kari, L., Mahalingam, K.: Watson-Crick palindromes. To appear in Natural Computing"},{"key":"14_CR14","doi-asserted-by":"publisher","first-page":"282","DOI":"10.1016\/j.tcs.2006.07.009","volume":"362","author":"A. Luca de","year":"2006","unstructured":"de Luca, A., de Luca, A.: Pseudopalindrome closure operators in free monoids. Theoretical Computer Science\u00a0362, 282\u2013300 (2006)","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"14_CR15","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1090\/S0002-9939-1965-0174934-9","volume":"16","author":"N.J. Fine","year":"1965","unstructured":"Fine, N.J., Wilf, H.S.: Uniqueness theorem for periodic functions. Proceedings of the American Mathematical Society\u00a016(1), 109\u2013114 (1965)","journal-title":"Proceedings of the American Mathematical Society"}],"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_14","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,9]],"date-time":"2019-03-09T01:33:13Z","timestamp":1552095193000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-02737-6_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642027369","9783642027376"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-02737-6_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}