{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T04:57:46Z","timestamp":1725771466283},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319049205"},{"type":"electronic","value":"9783319049212"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-04921-2_15","type":"book-chapter","created":{"date-parts":[[2014,2,5]],"date-time":"2014-02-05T13:52:25Z","timestamp":1391608345000},"page":"186-197","source":"Crossref","is-referenced-by-count":1,"title":["Solving Equations on Words with Morphisms and Antimorphisms"],"prefix":"10.1007","author":[{"given":"Alexandre","family":"Blondin Mass\u00e9","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S\u00e9bastien","family":"Gaboury","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sylvain","family":"Hall\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Micha\u00ebl","family":"Larouche","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"15_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"61","DOI":"10.1007\/3-540-55124-7_3","volume-title":"Word Equations and Related Topics","author":"H. Abdulrab","year":"1992","unstructured":"Abdulrab, H.: Implementation of Makanin\u2019s algorithm. In: Schulz, K.U. (ed.) IWWERT 1990. LNCS, vol.\u00a0572, pp. 61\u201384. Springer, Heidelberg (1992)"},{"key":"15_CR2","unstructured":"Blondin Mass\u00e9, A., Garon, A., Labb\u00e9, S.: Generation of double square tiles. Theoretical Computer Science (2012) (to appear)"},{"key":"15_CR3","doi-asserted-by":"crossref","unstructured":"Brlek, S.: Interactions between digital geometry and combinatorics on words. In: Ambroz, P., Holub, S., Mas\u00e1kov\u00e1, Z. (eds.) WORDS. EPTCS, vol.\u00a063, pp. 1\u201312 (2011)","DOI":"10.4204\/EPTCS.63.1"},{"key":"15_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"key":"15_CR5","unstructured":"Fraenkel, A.S., Simpson, J.: How many squares can a string contain? Journal of Combinatorial Theory, Series A 82(1), 112 \u2013 120 (1998), \n                    \n                      http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0097316597928430"},{"key":"15_CR6","unstructured":"Fu, X., Li, C.-C.: A string constraint solver for detecting web application vulnerability. In: SEKE, pp. 535\u2013542. Knowledge Systems Institute Graduate School (2010)"},{"key":"15_CR7","unstructured":"Gusfield, D.: Algorithms on strings, trees, and sequences: computer science and computational biology. Cambridge Univ. Press (January 2007), \n                    \n                      http:\/\/www.amazon.com\/exec\/obidos\/redirect?tag=citeulike07-20&path=ASIN\/0521585198"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"Kiezun, A., Ganesh, V., Artzi, S., Guo, P., Hooimeijer, P., Ernst, M.: HAMPI: A solver for word equations over strings, regular expressions and context-free grammars. ACM Trans. on Software Engineering and Methodology\u00a021(4) (2012) (to appear)","DOI":"10.1145\/2377656.2377662"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"Kiezun, A., Ganesh, V., Guo, P.J., Hooimeijer, P., Ernst, M.D.: Hampi: a solver for string constraints. In: Rothermel, G., Dillon, L.K. (eds.) ISSTA, pp. 105\u2013116. ACM (2009)","DOI":"10.1145\/1572272.1572286"},{"key":"15_CR10","doi-asserted-by":"crossref","unstructured":"Larouche, M., Blondin Mass, A., Gaboury, S., Hall, S.: Solving equations on words through Boolean satisfiability. In: Maldonado, J.C., Shin, S.Y. (eds.) SAC, pp. 104\u2013106. ACM (2013)","DOI":"10.1145\/2480362.2480385"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"Lothaire, M.: Algebraic Combinatorics on Words. Cambridge University Press (2002)","DOI":"10.1017\/CBO9781107326019"},{"key":"15_CR12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9781107341005","volume-title":"Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications)","author":"M. Lothaire","year":"2005","unstructured":"Lothaire, M.: Applied Combinatorics on Words (Encyclopedia of Mathematics and its Applications). Cambridge University Press, New York (2005)"},{"issue":"2","key":"15_CR13","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G. Makanin","year":"1977","unstructured":"Makanin, G.: The problem of solvability of equations in a free semigroup. Mathematics of the USSR-Sbornik\u00a032(2), 129 (1977)","journal-title":"Mathematics of the USSR-Sbornik"},{"key":"15_CR14","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of word equations with constants is in PSPACE. In: FOCS, pp. 495\u2013500. IEEE Computer Society (1999)","DOI":"10.1145\/301250.301443"},{"issue":"8","key":"15_CR15","doi-asserted-by":"publisher","first-page":"1909","DOI":"10.1142\/S0129054111009112","volume":"22","author":"F. Yu","year":"2011","unstructured":"Yu, F., Bultan, T., Ibarra, O.H.: Relational string verification using multi-track automata. Int. J. Found. Comput. Sci.\u00a022(8), 1909\u20131924 (2011)","journal-title":"Int. J. Found. Comput. Sci."}],"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-319-04921-2_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,26]],"date-time":"2019-05-26T05:57:15Z","timestamp":1558850235000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-04921-2_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319049205","9783319049212"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-04921-2_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]}}}