Fast Regular Expression Matching Based On Dual Glushkov NFA
暂无分享,去创建一个
[1] Gonzalo Navarro,et al. Flexible Pattern Matching in Strings: Practical On-Line Search Algorithms for Texts and Biological Sequences , 2002 .
[2] Derrick G. Kourie,et al. Improving Automata Efficiency by Stretching and Jamming , 2010, Stringology.
[3] Niccolo Cascarano,et al. iNFAnt: NFA pattern matching on GPGPU devices , 2010, CCRV.
[4] Gonzalo Navarro,et al. NR‐grep: a fast and flexible pattern‐matching tool , 2001, Softw. Pract. Exp..
[5] Derrick G. Kourie,et al. Stretching and jamming of automata , 2003 .
[6] W. Marsden. I and J , 2012 .
[7] Shinobu Nagayama,et al. An Efficient Hardware Matching Engine for Regular Expression with Nested Kleene Operators , 2011, 2011 21st International Conference on Field Programmable Logic and Applications.
[8] Dave Brown,et al. Supplementary Material for An Efficient and Scalable Semiconductor Architecture for Parallel Automata Processing , 2013 .
[9] Hiroki Arimura,et al. Dynamic reconfigurable bit-parallel architecture for large-scale regular expression matching , 2010, 2010 International Conference on Field-Programmable Technology.
[10] Gérard Berry,et al. From Regular Expressions to Deterministic Automata , 1986, Theor. Comput. Sci..
[11] Alfred V. Aho,et al. The Design and Analysis of Computer Algorithms , 1974 .
[12] B. Watson. A taxonomy of finite automata construction algorithms , 1993 .