{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,24]],"date-time":"2025-10-24T16:35:42Z","timestamp":1761323742750},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642194740"},{"type":"electronic","value":"9783642194757"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-19475-7_4","type":"book-chapter","created":{"date-parts":[[2011,3,25]],"date-time":"2011-03-25T17:19:34Z","timestamp":1301073574000},"page":"16-28","source":"Crossref","is-referenced-by-count":12,"title":["A Regular Expression Matching Circuit Based on a Decomposed Automaton"],"prefix":"10.1007","author":[{"given":"Hiroki","family":"Nakahara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tsutomu","family":"Sasao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Munehiro","family":"Matsuura","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"6","key":"4_CR1","doi-asserted-by":"publisher","first-page":"333","DOI":"10.1145\/360825.360855","volume":"18","author":"A.V. Aho","year":"1975","unstructured":"Aho, A.V., Corasick, M.J.: Efficient string matching: An aid to bibliographic search. Comm. of the ACM\u00a018(6), 333\u2013340 (1975)","journal-title":"Comm. of the ACM"},{"issue":"10","key":"4_CR2","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1145\/135239.135243","volume":"35","author":"R. Baeza-Yates","year":"1992","unstructured":"Baeza-Yates, R., Gonnet, G.H.: A new approach to text searching. Communications of the ACM\u00a035(10), 74\u201382 (1992)","journal-title":"Communications of the ACM"},{"doi-asserted-by":"crossref","unstructured":"Baker, Z.K., Jung, H., Prasanna, V.K.: Regular expression software deceleration for intrusion detection systems. In: FPL 2006, pp. 28\u201330 (2006)","key":"4_CR3","DOI":"10.1109\/FPL.2006.311246"},{"doi-asserted-by":"crossref","unstructured":"Bispo, J., Sourdis, I., Cardoso, J.M.P., Vassiliadis, S.: Regular expression matching for reconfigurable packet inspection. In: FPT 2006, pp. 119\u2013126 (2006)","key":"4_CR4","DOI":"10.1109\/FPT.2006.270302"},{"doi-asserted-by":"crossref","unstructured":"Brodie, B.C., Taylor, D.E., Cytron, R.K.: A scalable architecture for high-throughput regular-expression pattern matching. In: ISCA 2006, pp. 191\u2013202 (2006)","key":"4_CR5","DOI":"10.1145\/1150019.1136500"},{"unstructured":"Clam Anti Virus: open source anti-virus toolkit, \n                    \n                      http:\/\/www.clamav.net\/lang\/en\/","key":"4_CR6"},{"key":"4_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1007\/978-3-540-70844-5_15","volume-title":"Implementation and Applications of Automata","author":"R. Dixon","year":"2008","unstructured":"Dixon, R., Egecioglu, O., Sherwood, T.: Automata-theoretic analysis of bit-split languages for packet scanning. In: Ibarra, O.H., Ravikumar, B. (eds.) CIAA 2008. LNCS, vol.\u00a05148, pp. 141\u2013150. Springer, Heidelberg (2008)"},{"unstructured":"Firekeeper: Detect and block malicious sites, \n                    \n                      http:\/\/firekeeper.mozdev.org\/","key":"4_CR8"},{"key":"4_CR9","volume-title":"Switching and Finite Automata Theory","author":"Z. Kohavi","year":"1979","unstructured":"Kohavi, Z.: Switching and Finite Automata Theory. McGraw-Hill Inc., New York (1979)"},{"unstructured":"Application Layer Packet Classifier for Linux, \n                    \n                      http:\/\/l7-filter.sourceforge.net\/","key":"4_CR10"},{"unstructured":"Lin, C., Huang, C., Jiang, C., Chang, S.: Optimization of regular expression pattern matching circuits on FPGA. In: DATE 2006, pp. 12\u201317 (2006)","key":"4_CR11"},{"unstructured":"Nakahara, H., Sasao, T., Matsuura, M.: A regular expression matching circuit based on a modular non-deterministic finite automaton with multi-character transition. In: SASIMI 2010, Taipei, October\u00a018-19, pp. 359\u2013364 (2010)","key":"4_CR12"},{"doi-asserted-by":"crossref","unstructured":"Nakahara, H., Sasao, T., Matsuura, M.: A regular expression matching using non-deterministic finite automaton. In: MEMOCODE 2010, Grenoble, France, July 26-28, pp. 73\u201376 (2010)","key":"4_CR13","DOI":"10.1109\/MEMCOD.2010.5558621"},{"unstructured":"Sidhu, R., Prasanna, V.K.: Fast regular expression matching using FPGA. In: FCCM 2001, pp. 227\u2013238 (2001)","key":"4_CR14"},{"unstructured":"SNORT official web site, \n                    \n                      http:\/\/www.snort.org","key":"4_CR15"},{"unstructured":"SPAMASSASSIN: Open-Source Spam Filter, \n                    \n                      http:\/\/spamassassin.apache.org\/","key":"4_CR16"},{"unstructured":"Spartan\u00a0III data sheet, \n                    \n                      http:\/\/www.xilinx.com\/","key":"4_CR17"},{"doi-asserted-by":"crossref","unstructured":"Tan, L., Sherwood, T.: A high throughput string matching architecture for intrusion detection and prevention. In: ISCA 2005, pp. 112\u2013122 (2005)","key":"4_CR18","DOI":"10.1145\/1080695.1069981"},{"unstructured":"Using Look-up tables as shift registers\u00a0(SRL16), \n                    \n                      http:\/\/www.xilinx.com\/support\/documentation\/application_notes\/xapp465.pdf","key":"4_CR19"},{"doi-asserted-by":"crossref","unstructured":"Yu, F., Chen, Z., Diao, Y., Lakshman, T.V., Katz, R.H.: Fast and memory-efficient regular expression matching for deep packet inspection. In: ANCS 2006, pp. 93\u2013102 (2006)","key":"4_CR20","DOI":"10.1145\/1185347.1185360"}],"container-title":["Lecture Notes in Computer Science","Reconfigurable Computing: Architectures, Tools and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-19475-7_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T11:01:25Z","timestamp":1558436485000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-19475-7_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642194740","9783642194757"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-19475-7_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}