{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T17:33:05Z","timestamp":1725557585252},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540406716"},{"type":"electronic","value":"9783540451389"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45138-9_13","type":"book-chapter","created":{"date-parts":[[2010,6,22]],"date-time":"2010-06-22T18:41:48Z","timestamp":1277232108000},"page":"189-197","source":"Crossref","is-referenced-by-count":0,"title":["On the Length of the Minimum Solution of Word Equations in One Variable"],"prefix":"10.1007","author":[{"given":"Kensuke","family":"Baba","sequence":"first","affiliation":[]},{"given":"Satoshi","family":"Tsuruta","sequence":"additional","affiliation":[]},{"given":"Ayumi","family":"Shinohara","sequence":"additional","affiliation":[]},{"given":"Masayuki","family":"Takeda","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1016\/0022-0000(80)90041-0","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding Patterns Common to a Set of Strings. J. Comput. Sys. Sci.\u00a021, 46\u201362 (1980)","journal-title":"J. Comput. Sys. Sci."},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science","first-page":"43","volume-title":"Word Equations and Related Topics","author":"W. Charatonik","year":"1991","unstructured":"Charatonik, W., Pacholski, L.: Word Equations in Two Variables. In: Abdulrab, H., Pecuchet, J.-P. (eds.) IWWERT 1991. LNCS, vol.\u00a0677, pp. 43\u201357. Springer, Heidelberg (1991)"},{"key":"13_CR3","volume-title":"Text Algorithms","author":"M. Crochemore","year":"1994","unstructured":"Crochemore, M., Rytter, W.: Text Algorithms. Oxford University Press, New York (1994)"},{"key":"13_CR4","volume-title":"Jewels of Stringology","author":"M. Crochemore","year":"2003","unstructured":"Crochemore, M., Rytter, W.: Jewels of Stringology. World Scientific, Singapore (2003)"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/3-540-45687-2_17","volume-title":"Mathematical Foundations of Computer Science 2002","author":"R. Da\u0327browski","year":"2002","unstructured":"Da\u0327browski, R., Plandowski, W.: On Word Equations in One Variable. In: Diks, K., Rytter, W. (eds.) MFCS 2002. LNCS, vol.\u00a02420, pp. 212\u2013220. Springer, Heidelberg (2002)"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-58338-6_80","volume-title":"Mathematical Foundations of Computer Science 1994","author":"S. Eyono Obono","year":"1994","unstructured":"Eyono Obono, S., Goralcik, P., Maksimenko, M.: Efficient Solving of the Word Equations in One Variable. In: Privara, I., Ru\u017ei\u010dka, P., Rovan, B. (eds.) MFCS 1994. LNCS, vol.\u00a0841, pp. 336\u2013341. Springer, Heidelberg (1994)"},{"key":"13_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"122","DOI":"10.1007\/3-540-46541-3_10","volume-title":"STACS 2000","author":"L. Ilie","year":"2000","unstructured":"Ilie, L., Plandowski, W.: Two-Variable Word Equations. In: Reichel, H., Tison, S. (eds.) STACS 2000. LNCS, vol.\u00a01770, pp. 122\u2013132. Springer, Heidelberg (2000)"},{"key":"13_CR8","unstructured":"Khmelevski\u012d, Y.I.: Equations in Free Semigroups. In: Proc. Steklov Inst. of Mathematics, vol.\u00a0107. AMS, Providence (1976)"},{"key":"13_CR9","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781107326019","volume-title":"Algebraic Combinatorics on Words","author":"M. Lothaire","year":"2002","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press, Cambridge (2002)"},{"key":"13_CR10","doi-asserted-by":"crossref","unstructured":"Makanin, G.S.: The Problem of Solvability of Equations in a Free Semigroup. Mat. Sb. 103(2), 147\u2013236 (In Russian); English translation. In: Math. USSR Sbornik, 32, 129\u2013198 (1977)","DOI":"10.1070\/SM1977v032n02ABEH002376"},{"key":"13_CR11","first-page":"495","volume-title":"Proc. FOCS 1999","author":"W. Plandowski","year":"1999","unstructured":"Plandowski, W.: Satisfiability of Word Equations with Constants is in PSPACE. In: Proc. FOCS 1999, pp. 495\u2013500. IEEE Computer Society Press, Los Alamitos (1999)"}],"container-title":["Lecture Notes in Computer Science","Mathematical Foundations of Computer Science 2003"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45138-9_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T05:54:10Z","timestamp":1559195650000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45138-9_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540406716","9783540451389"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45138-9_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}