{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:03:05Z","timestamp":1740096185898,"version":"3.37.3"},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642283314"},{"type":"electronic","value":"9783642283321"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-28332-1_16","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T09:45:36Z","timestamp":1330508736000},"page":"179-191","source":"Crossref","is-referenced-by-count":4,"title":["Approximate Regular Expressions and Their Derivatives"],"prefix":"10.1007","author":[{"given":"Jean-Marc","family":"Champarnaud","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadrien","family":"Jeanne","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ludovic","family":"Mignot","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"291","DOI":"10.1016\/0304-3975(95)00182-4","volume":"155","author":"V. Antimirov","year":"1996","unstructured":"Antimirov, V.: Partial derivatives of regular expressions and finite automaton constructions. Theoret. Comput. Sci.\u00a0155, 291\u2013319 (1996)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"16_CR2","doi-asserted-by":"publisher","first-page":"481","DOI":"10.1145\/321239.321249","volume":"11","author":"J.A. Brzozowski","year":"1964","unstructured":"Brzozowski, J.A.: Derivatives of regular expressions. J. Assoc. Comput. Mach.\u00a011(4), 481\u2013494 (1964)","journal-title":"J. Assoc. Comput. Mach."},{"key":"16_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"179","DOI":"10.1007\/978-3-642-21254-3_13","volume-title":"Language and Automata Theory and Applications","author":"P. Caron","year":"2011","unstructured":"Caron, P., Champarnaud, J.-M., Mignot, L.: Partial Derivatives of an Extended Regular Expression. In: Dediu, A.-H., Inenaga, S., Mart\u00edn-Vide, C. (eds.) LATA 2011. LNCS, vol.\u00a06638, pp. 179\u2013191. Springer, Heidelberg (2011)"},{"key":"16_CR4","series-title":"SCI","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1007\/978-3-540-33461-3_3","volume-title":"Recent Advances in Formal Languages and Applications","author":"M. Crochemore","year":"2006","unstructured":"Crochemore, M., Lecroq, T.: Text searching and indexing. In: Recent Advances in Formal Languages and Applications. SCI, vol.\u00a025, pp. 43\u201380. Springer, Heidelberg (2006)"},{"unstructured":"El-Mabrouk, N.: Recherche approch\u00e9e de motifs - Application \u00e0 des s\u00e9quences biologiques structur\u00e9es. Ph.D. thesis, LITP, Universit\u00e9 Paris 7, France (1996)","key":"16_CR5"},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"295","DOI":"10.1007\/3-540-44977-9_32","volume-title":"Implementation and Application of Automata","author":"J. Holub","year":"2003","unstructured":"Holub, J.: Dynamic Programming - NFA Simulation. In: Champarnaud, J.-M., Maurel, D. (eds.) CIAA 2002. LNCS, vol.\u00a02608, pp. 295\u2013300. Springer, Heidelberg (2003)"},{"issue":"12","key":"16_CR7","doi-asserted-by":"publisher","first-page":"1439","DOI":"10.1002\/(SICI)1097-024X(199612)26:12<1439::AID-SPE71>3.0.CO;2-1","volume":"26","author":"P. Jokinen","year":"1996","unstructured":"Jokinen, P., Tarhio, J., Ukkonen, E.: A comparison of approximate string matching algorithms. Softw., Pract. Exper.\u00a026(12), 1439\u20131458 (1996)","journal-title":"Softw., Pract. Exper."},{"key":"16_CR8","first-page":"3","volume":"Ann. Math. Stud","author":"S. Kleene","year":"1956","unstructured":"Kleene, S.: Representation of events in nerve nets and finite automata. Automata Studies\u00a0Ann. Math. Studies 34, 3\u201341 (1956)","journal-title":"Automata Studies"},{"unstructured":"Muz\u00e1tko, P.: Approximate regular expression matching. In: Stringology, pp. 37\u201341. Department of Computer Science and Engineering, Faculty of Electrical Engineering, Czech Technical University (1996)","key":"16_CR9"},{"key":"16_CR10","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/BF02458834","volume":"51","author":"E. Myers","year":"1989","unstructured":"Myers, E., Miller, W.: Approximate matching of regular expressions. Bulletin of Mathematical Biology\u00a051, 5\u201337 (1989), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/BF02458834\n                    \n                    \n                  , doi:10.1007\/BF02458834","journal-title":"Bulletin of Mathematical Biology"},{"unstructured":"Myhill, J.: Finite automata and the representation of events. WADD TR-57-624, 112\u2013137 (1957)","key":"16_CR11"},{"issue":"1","key":"16_CR12","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1145\/375360.375365","volume":"33","author":"G. Navarro","year":"2001","unstructured":"Navarro, G.: A guided tour to approximate string matching. ACM Computing Surveys\u00a033(1), 31\u201388 (2001)","journal-title":"ACM Computing Surveys"},{"key":"16_CR13","doi-asserted-by":"publisher","first-page":"46","DOI":"10.1007\/978-0-387-30162-4_22","volume-title":"Encyclopedia of Algorithms","author":"G. Navarro","year":"2008","unstructured":"Navarro, G.: Approximate regular expression matching. In: Kao, M.-Y. (ed.) Encyclopedia of Algorithms, pp. 46\u201348. Springer, Heidelberg (2008)"},{"doi-asserted-by":"crossref","unstructured":"Nerode, A.: Linear automata transformation. Proceedings of AMS 9, 541\u2013544 (1958)","key":"16_CR14","DOI":"10.1090\/S0002-9939-1958-0135681-9"},{"issue":"1","key":"16_CR15","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/s10032-002-0082-8","volume":"5","author":"K.U. Schulz","year":"2002","unstructured":"Schulz, K.U., Mihov, S.: Fast string correction with levenshtein automata. IJDAR\u00a05(1), 67\u201385 (2002)","journal-title":"IJDAR"},{"key":"16_CR16","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1007\/BF01769703","volume":"10","author":"E. Ukkonen","year":"1993","unstructured":"Ukkonen, E., Wood, D.: Approximate string matching with suffix automata. Algorithmica\u00a010, 353\u2013364 (1993), \n                    \n                      http:\/\/dx.doi.org\/10.1007\/BF01769703\n                    \n                    \n                  , doi:10.1007\/BF01769703","journal-title":"Algorithmica"}],"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-642-28332-1_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T04:28:47Z","timestamp":1556425727000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-28332-1_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642283314","9783642283321"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-28332-1_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}