{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,10,22]],"date-time":"2024-10-22T20:10:41Z","timestamp":1729627841229,"version":"3.28.0"},"reference-count":23,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013,12]]},"DOI":"10.1109\/fpt.2013.6718381","type":"proceedings-article","created":{"date-parts":[[2014,1,24]],"date-time":"2014-01-24T16:19:42Z","timestamp":1390580382000},"page":"338-341","source":"Crossref","is-referenced-by-count":3,"title":["NFA reduction for regular expressions matching using FPGA"],"prefix":"10.1109","author":[{"given":"Vlastimil","family":"Kosar","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Zadnik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jan","family":"Korenek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45007-6_15"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1016\/S0304-3975(03)00311-6"},{"key":"22","doi-asserted-by":"crossref","first-page":"956","DOI":"10.1007\/978-3-540-45234-8_94","article-title":"Efficient reconfigurable logic circuits for matching complex network intrusion detection patterns","author":"clark","year":"2003","journal-title":"Field Programmable Logic and Application 13th International Conference Lisbon Portugal"},{"key":"18","article-title":"Reducing the size of nfas by using equivalences and preorders","author":"ilie","year":"2002","journal-title":"Combinatorial Pattern Matching Jeju Island South Korea"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1109\/FPL.2010.19"},{"journal-title":"Simulations and Antichains for Efficient Handling of Finite Automata","year":"2011","author":"hol'ik","key":"15"},{"key":"16","first-page":"328","article-title":"Algorithms for computing small nfas","author":"ilie","year":"2002","journal-title":"Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science Ser MFCS '02"},{"key":"13","doi-asserted-by":"publisher","DOI":"10.1023\/A:1027328830731"},{"key":"14","first-page":"480","article-title":"Simulation revisited","author":"tan","year":"2001","journal-title":"Proceedings of the 7th International Conference on Tools and Algorithms for the Construction and Analysis of Systems Ser TACAS"},{"key":"11","doi-asserted-by":"publisher","DOI":"10.1016\/B978-0-12-417750-5.50022-1"},{"key":"12","first-page":"629","volume":"510","author":"jiang","year":"1991","journal-title":"Minimal Nfa Problems Are Hard Automata Languages and Programming Ser Lecture Notes in Computer Science"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477950"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ANCS.2011.25"},{"journal-title":"L7-filter","year":"2013","key":"2"},{"key":"20","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-76336-9_12"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477950"},{"journal-title":"SNORT","year":"2013","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1145\/1477942.1477948"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/TVLSI.2007.909801"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1109\/FCCM.2004.50"},{"key":"4","doi-asserted-by":"publisher","DOI":"10.1145\/1185347.1185359"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1007\/s11265-007-0131-0"},{"key":"8","first-page":"227","article-title":"Fast regular expression matching using fpgas","author":"sidhu","year":"2001","journal-title":"FCCM '01 Proceedings of the the 9th Annual IEEE Symposium on Field-Programmable Custom Computing Machines IEEE Computer Society"}],"event":{"name":"2013 International Conference on Field-Programmable Technology (FPT)","start":{"date-parts":[[2013,12,9]]},"location":"Kyoto, Japan","end":{"date-parts":[[2013,12,11]]}},"container-title":["2013 International Conference on Field-Programmable Technology (FPT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6712172\/6718311\/06718381.pdf?arnumber=6718381","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,6]],"date-time":"2019-08-06T21:02:29Z","timestamp":1565125349000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6718381\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,12]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/fpt.2013.6718381","relation":{},"subject":[],"published":{"date-parts":[[2013,12]]}}}