{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T20:17:24Z","timestamp":1762460244310},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540766308"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-76631-5_30","type":"book-chapter","created":{"date-parts":[[2007,10,22]],"date-time":"2007-10-22T02:33:07Z","timestamp":1193020387000},"page":"316-326","source":"Crossref","is-referenced-by-count":0,"title":["A Word Equation Solver Based on Levensthein Distance"],"prefix":"10.1007","author":[{"given":"C\u00e9sar L.","family":"Alonso","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Alonso","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mar","family":"Callau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jos\u00e9 Luis","family":"Monta\u00f1a","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/978-3-540-25945-9_15","volume-title":"Current Topics in Artificial Intelligence","author":"C.L. Alonso","year":"2004","unstructured":"Alonso, C.L., Drubi, F., Monta\u00f1a, J.L.: An Evolutionary Algorithm for Solving Word Equation Systems. In: Conejo, R., Urretavizcaya, M., P\u00e9rez-de-la-Cruz, J.L. (eds.) Current Topics in Artificial Intelligence. LNCS (LNAI), vol.\u00a03040, pp. 147\u2013156. Springer, Heidelberg (2004)"},{"key":"30_CR2","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"crossref","first-page":"83","DOI":"10.1007\/978-3-540-28645-5_9","volume-title":"Advances in Artificial Intelligence-SBIA 2004","author":"C.L. Alonso","year":"2004","unstructured":"Alonso, C.L., Drubi, F., G\u00f3mez-Garc\u00eda, J., Monta\u00f1a, J.L.: Word Equation Systems: The Heuristic Approach. In: Bazzan, A.L.C., Labidi, S. (eds.) SBIA 2004. LNCS (LNAI), vol.\u00a03171, pp. 83\u201392. Springer, Heidelberg (2004)"},{"issue":"1","key":"30_CR3","first-page":"46","volume":"21","author":"D. Angluin","year":"1980","unstructured":"Angluin, D.: Finding patterns common to a set of strings, J. J. C. S. S.\u00a021(1), 46\u201362 (1980)","journal-title":"J. C. S. S."},{"key":"30_CR4","volume-title":"Handbook of Logic in Artif. Int. and Logic Prog","author":"F. Baader","year":"1994","unstructured":"Baader, F., Siekmann, J.H.: Unification Theory. In: Handbook of Logic in Artif. Int. and Logic Prog, vol.\u00a02, Clarendon Press, Oxford (1994)"},{"key":"30_CR5","first-page":"81","volume-title":"4th IEEE Conference on Evolutionary Computation","author":"A. Eiben","year":"1997","unstructured":"Eiben, A., van der Hauw, J.: Solving 3-SAT with adaptive Genetic Algorithms. In: 4th IEEE Conference on Evolutionary Computation, pp. 81\u201386. IEEE Press, Los Alamitos (1997)"},{"key":"30_CR6","volume-title":"Genetic Algorithms in Search Optimization & Machine Learning","author":"D.E. Goldbert","year":"1989","unstructured":"Goldbert, D.E.: Genetic Algorithms in Search Optimization & Machine Learning. Addison Wesley Longmann, London (1989)"},{"key":"30_CR7","doi-asserted-by":"crossref","unstructured":"Gottlieb, J., Marchiori, E., Rossi, C.: Evolutionary Algorithms for the Satisfiability Problem. Evolutionary Computation\u00a010(1) (2002)","DOI":"10.1162\/106365602317301763"},{"key":"30_CR8","volume-title":"Proc. FOCS 1998","author":"C. Guti\u00e9rrez","year":"1998","unstructured":"Guti\u00e9rrez, C.: Satisfiability of word equations with constants is in exponential space. In: Proc. FOCS 1998, IEEE Computer Society Press, California (1998)"},{"key":"30_CR9","first-page":"21","volume-title":"STOC 2000","author":"C. Guti\u00e9rrez","year":"2000","unstructured":"Guti\u00e9rrez, C.: Satisfiability of equations in free groups is in PSPACE. In: STOC 2000. Theory of Computing, pp. 21\u201327. ACM Press, New York (2000)"},{"issue":"4","key":"30_CR10","first-page":"845","volume":"163","author":"V.I. Levenshtein","year":"1965","unstructured":"Levenshtein, V.I.: Bynary Coded Capable of Correcting Deletions, Insertions and Reversals. Doklads Akademii Nauk SSR\u00a0163(4), 845\u2013848 (1965)","journal-title":"Doklads Akademii Nauk SSR"},{"issue":"2","key":"30_CR11","doi-asserted-by":"publisher","first-page":"129","DOI":"10.1070\/SM1977v032n02ABEH002376","volume":"32","author":"G.S. Makanin","year":"1977","unstructured":"Makanin, G.S.: The Problem of Solvability of Equations in a Free Semigroup. Math. USSR Sbornik\u00a032(2), 129\u2013198 (1977)","journal-title":"Math. USSR Sbornik"},{"key":"30_CR12","unstructured":"Marchiori, E., Rossi, C.: A Flipping Genetic Algorithm for Hard 3-SAT Problems. In: Banzhaf, W., et al. (eds.) Proccedings of G.E.C.C.O., pp. 393\u2013400 (1999)"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Plandowski, W.: Satisfiability of Word Equations with Constants is in PSPACE. In: FOCS 1999, pp. 495\u2013500 (1999)","DOI":"10.1109\/SFFCS.1999.814622"},{"key":"30_CR14","doi-asserted-by":"publisher","first-page":"467","DOI":"10.1145\/1132516.1132584","volume-title":"Annual ACM Symposium on Theory of Computing archive Proceedings of the thirty-eighth annual ACM symposium on Theory of computing","author":"W. Plandowski","year":"2006","unstructured":"Plandowski, W.: An efficient algorithm for solving word equations. In: Annual ACM Symposium on Theory of Computing archive Proceedings of the thirty-eighth annual ACM symposium on Theory of computing, pp. 467\u2013476. ACM Press, New York (2006)"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/BFb0055097","volume-title":"Automata, Languages and Programming","author":"W. Plandowski","year":"1998","unstructured":"Plandowski, W., Rytter, W.: Application of Lempel-Ziv encodings to the Solution of Words Equations. In: Larsen, K.G., Skyum, S., Winskel, G. (eds.) ICALP 1998. LNCS, vol.\u00a01443, pp. 731\u2013742. Springer, Heidelberg (1998)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/3-540-49116-3_20","volume-title":"STACS 99","author":"J.M. Robson","year":"1999","unstructured":"Robson, J.M., Diekert, V.: On quadratic Word Equations. In: Meinel, C., Tison, S. (eds.) STACS 99. LNCS, vol.\u00a01563, pp. 217\u2013226. Springer, Heidelberg (1999)"},{"key":"30_CR17","first-page":"125","volume-title":"Application of Formal Methods, International Series in Computer Science, ch.7","author":"M.K. Srivas","year":"1995","unstructured":"Srivas, M.K., Miller, S.P.: formal Verification of the AAMP5 Microprocesor. In: Hinchey, M.G., Bowen, J.P. (eds.) Application of Formal Methods, International Series in Computer Science, ch.7, pp. 125\u2013180. Prentice-Hall, Hemel Hempstead (1995)"},{"issue":"3","key":"30_CR18","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/BF01206331","volume":"14","author":"E. Ukkonen","year":"1995","unstructured":"Ukkonen, E.: On-line construction of suffix trees. Algorithmica\u00a014(3), 249\u2013260 (1995)","journal-title":"Algorithmica"}],"container-title":["Lecture Notes in Computer Science","MICAI 2007: Advances in Artificial Intelligence"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-76631-5_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T10:55:54Z","timestamp":1619520954000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-76631-5_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540766308"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-76631-5_30","relation":{},"subject":[]}}