您当前的位置:
首页 >
文章列表页 >
States constrain-based algorithm for large scale regular expression matching
Academic communication | 更新时间:2024-06-05
    • States constrain-based algorithm for large scale regular expression matching

    • Journal on Communications   Vol. 34, Issue 10, Pages: 183-190(2013)
    • DOI:10.3969/j.issn.1000-436x.2013.10.021    

      CLC: TP393
    • Online First:2013-10

      Published:25 October 2013

    移动端阅览

  • Wei HE, Yun-fei GUO, Hong-chao HU. States constrain-based algorithm for large scale regular expression matching[J]. Journal on Communications, 2013, 34(10): 183-190. DOI: 10.3969/j.issn.1000-436x.2013.10.021.

  •  
  •  

0

Views

810

下载量

1

CSCD

Alert me when the article has been cited
提交
Tools
Download
Export Citation
Share
Add to favorites
Add to my album

Related Articles

Improved DFA algorithm based on multi-dimensional finite automata
Novel NFA engine construction method of regular expressions
Regular expression matching technology with two-stage memory
Efficient i-DFA construction algorithm based on state grouping
Automatic generating regular expression signatures for real network worms

Related Author

ENGZhi-bin P
IAOHui-juan J
INGChi-qiang X
HAOXiang-yu S
ANGZhen-xi Y
IUQin-rang L
ONGYang-yang G
Yang XIN

Related Institution

National Digital Switching System Engineering R&D Center
Collge of Chemical Engineering,China University of Petroleum
School of Computer and Communication Engineering,Northeastern University at Qinhuangdao
College of Information Science and Engineering,Northeastern University
Beijing Engineering Lab for Cloud Security
0