{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,4]],"date-time":"2025-11-04T23:00:46Z","timestamp":1762297246338},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540671411"},{"type":"electronic","value":"9783540465416"}],"license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-46541-3_10","type":"book-chapter","created":{"date-parts":[[2007,8,2]],"date-time":"2007-08-02T12:03:24Z","timestamp":1186056204000},"page":"122-132","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Two-Variable Word Equations"],"prefix":"10.1007","author":[{"given":"Lucian","family":"Ilie","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wojciech","family":"Plandowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2000,3,24]]},"reference":[{"issue":"1","key":"10_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. System Sci.\n                        21(1) (1980) 46\u201362.","journal-title":"J. Comput. System Sci."},{"key":"10_CR2","unstructured":"Berstel, J., Recent results in Sturmian words, in J. Dassow, G. Rozenberg, A. Salomaa, eds., Developments in Language Theory II, 13\u201324, World Sci. Publishing, 1996."},{"key":"10_CR3","series-title":"Lect Notes Comput Sci","first-page":"43","volume-title":"Proc. of IWWERT\u201991","author":"W. Charatonik","year":"1991","unstructured":"Charatonik, W. and Pacholski, L., Word equations with two variables, Proc. of IWWERT\u201991, H. Abdulrab, J. P. Pecuchet, eds., 43\u201357, LNCS 667, Springer, Berlin, 1991."},{"key":"10_CR4","doi-asserted-by":"crossref","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. and Karhum\u00e4ki, J., Combinatorics of words, in G. Rozenberg, A. Salomaa, eds., Handbook of Formal Languages, 329\u2013438, Springer, Berlin, 1997."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/0304-3975(94)00035-H","volume":"136","author":"A. Luca de","year":"1994","unstructured":"de Luca, A. and Mignosi, F., Some combinatorial properties of sturmian words, Theoret. Comput. Sci.\n                        136 361\u2013385, 1994.","journal-title":"Theoret. Comput. Sci."},{"key":"10_CR6","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"336","DOI":"10.1007\/3-540-58338-6_80","volume-title":"Proc. of MFCS\u201994","author":"S. Eyono Obono","year":"1994","unstructured":"Eyono Obono, S., Goralcik, P., and Maksimenko, M., Efficient solving of the word equations in one variable, in Proc. of MFCS\u201994, 336\u2013341, LNCS 841, Springer, Berlin, 1994."},{"key":"10_CR7","unstructured":"Hmelevskii, Yu. I., Equations in free semigroups, Trudy Mat. Inst. Steklov\n                        107 1971. English transl. Proc Steklov Inst. of Mathematics\n                        107 (1971), Amer. Math. Soc., 1976."},{"issue":"1","key":"10_CR8","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1006\/jcss.1995.1006","volume":"50","author":"T. Jiang","year":"1995","unstructured":"Jiang, T., Salomaa, A., Salomaa, K., and Yu, S., Decision problems for patterns, J. Comput. System Sci.\n                        50(1) (1995) 53\u201363.","journal-title":"J. Comput. System Sci."},{"key":"10_CR9","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1007\/3-540-63165-8_168","volume-title":"Proc. of ICALP\u201997","author":"J. Karhum\u00e4ki","year":"1997","unstructured":"Karhum\u00e4ki, J., Mignosi, F., and Plandowski, W., The expressibility of languages and relations by word equations, in Proc. of ICALP\u201997, 98\u2013109, LNCS 1256, Springer, Berlin, 1997."},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"670","DOI":"10.1145\/234533.234543","volume":"43","author":"A. Koscielski","year":"1996","unstructured":"Koscielski, A. and Pacholski, L., Complexity of Makanin\u2019s algorithm, Journal of the ACM, 43(4), 670\u2013684, 1996.","journal-title":"Journal of the ACM"},{"key":"10_CR11","volume-title":"Combinatorics on Words","author":"M. Lothaire","year":"1983","unstructured":"Lothaire, M., Combinatorics on Words, Addison-Wesley, Reading, Mass., 1983."},{"issue":"145","key":"10_CR12","first-page":"147","volume":"103","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S., The problem of solvability of equations in a free semigroup, Mat. Sb.\n                        103(145), 147\u2013233, 1977. English transl. in Math. U.S.S.R. Sb. 32, 1977.","journal-title":"Mat. Sb."},{"key":"10_CR13","series-title":"Lect Notes Comput Sci","volume-title":"Automata on infinite words","author":"G. Rauzy","year":"1984","unstructured":"Rauzy, G., Mots infinis en arithmetique, in M. Nivat, D. Perrin, eds., Automata on infinite words, LNCS 192, Springer, Berlin, 1984."},{"issue":"1","key":"10_CR14","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1070\/IM1985v025n01ABEH001272","volume":"25","author":"A. Razborov","year":"1985","unstructured":"Razborov, A., On systems of equations in a free group, Math. USSR Izvestija\n                        25(1), 115\u2013162, 1985.","journal-title":"Math. USSR Izvestija"},{"key":"10_CR15","unstructured":"Razborov, A., On systems of equations in a free group, Ph.D. Thesis, Moscow State University, 1987."},{"key":"10_CR16","volume-title":"Elementary Theory of Numbers","author":"W. Sierpinski","year":"1988","unstructured":"Sierpinski, W., Elementary Theory of Numbers, Elseviers Science Publishers B.V., Amsterdam, and PWN-Polish Scientific Publishers, Warszawa, 1988."}],"container-title":["Lecture Notes in Computer Science","STACS 2000"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-46541-3_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,1,8]],"date-time":"2020-01-08T12:58:31Z","timestamp":1578488311000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-46541-3_10"}},"subtitle":["Extended Abstract"],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540671411","9783540465416"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/3-540-46541-3_10","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2000]]},"assertion":[{"value":"24 March 2000","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}