{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:14:19Z","timestamp":1761707659079},"reference-count":12,"publisher":"Informa UK Limited","issue":"4","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer Mathematics"],"published-print":{"date-parts":[[2004,4]]},"DOI":"10.1080\/00207160310001650025","type":"journal-article","created":{"date-parts":[[2004,4,6]],"date-time":"2004-04-06T00:37:18Z","timestamp":1081211838000},"page":"383-401","source":"Crossref","is-referenced-by-count":10,"title":["Compact and fast algorithms for safe regular expression search"],"prefix":"10.1080","volume":"81","author":[{"given":"J.-M.","family":"Champarnaud","sequence":"first","affiliation":[]},{"given":"F.","family":"Coulon*","sequence":"additional","affiliation":[]},{"given":"T.","family":"Parantho\u00ebn","sequence":"additional","affiliation":[]}],"member":"301","reference":[{"key":"b1","first-page":"1\u20132, 17\u201334","volume":"267","author":"Champarnaud J.-M.","year":"2001","journal-title":"Theoret. Comp. Sc."},{"key":"b2","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(97)00296-X"},{"key":"b3","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(99)00019-5"},{"key":"b4","first-page":"pp. 1\u201312","volume-title":"Lecture Notes in Computer Science, 5th Workshop of Algorithm Engineering","author":"Navarro G.","year":"2001"},{"key":"b5","unstructured":"Champarnaud J.M. (2002) A propos du calcul exhaustif du d\u00e9terminis\u00e9 d'un automate homog\u00e8ne Manuscript"},{"key":"b6","unstructured":"Coulon F. (2003) CCP\u2014a compact fast algorithm for regular expression search Source codehttp:\/\/www.univ-rouen.fr\/LIFAR\/aia\/ccp.html"},{"key":"b7","first-page":"pp. 41\u2013110","volume-title":"Handbook of Formal Languages. Word, Language, Grammar","author":"Yu S.","year":"1997"},{"key":"b8","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781316135228","volume-title":"Flexible Pattern Matching in Strings\u2014Practical On-line Search Algorithms for Texts and Biological Sequences","author":"Navarro G.","year":"2002"},{"key":"b9","first-page":"pp. 83\u201391","volume":"35","author":"Wu S.","year":"1992","journal-title":"CACM"},{"key":"b10","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(93)90287-4"},{"key":"b11","first-page":"pp. 90\u2013110","volume-title":"Lecture Notes in Computer Science, 3rd Symposium on Combinatorial Pattern Matching","author":"Chang C.-H.","year":"1992"},{"key":"b12","first-page":"pp. 109\u2013119","volume-title":"Lecture Notes in Computer Science, First Workshop on Implementing Automata","author":"Ponty J.-L.","year":"1997"}],"container-title":["International Journal of Computer Mathematics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.tandfonline.com\/doi\/pdf\/10.1080\/00207160310001650025","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,16]],"date-time":"2017-06-16T04:41:35Z","timestamp":1497588095000},"score":1,"resource":{"primary":{"URL":"http:\/\/www.tandfonline.com\/doi\/abs\/10.1080\/00207160310001650025"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004,4]]},"references-count":12,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2004,4]]}},"alternative-id":["10.1080\/00207160310001650025"],"URL":"https:\/\/doi.org\/10.1080\/00207160310001650025","relation":{},"ISSN":["0020-7160","1029-0265"],"issn-type":[{"value":"0020-7160","type":"print"},{"value":"1029-0265","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004,4]]}}}