您当前的位置:
首页 >
文章列表页 >
Efficient i-DFA construction algorithm based on state grouping
Papers | 更新时间:2024-06-05
    • Efficient i-DFA construction algorithm based on state grouping

    • Journal on Communications   Vol. 34, Issue 8, Pages: 102-109(2013)
    • DOI:10.3969/j.issn.1000-436x.2013.08.014    

      CLC: TP393.08
    • Online First:2013-08

      Published:25 August 2013

    移动端阅览

  • Deng-ke QIAO, Qing WANG, Ting-wen LIU, et al. Efficient i-DFA construction algorithm based on state grouping[J]. Journal on Communications, 2013, 34(8): 102-109. DOI: 10.3969/j.issn.1000-436x.2013.08.014.

  •  
  •  

0

Views

731

下载量

3

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
States constrain-based algorithm for large scale regular expression matching
Research on intelligent optimization of cryptogram service scheduling for service composition

Related Author

ENGZhi-bin P
ANGZhen-xi Y
IUQin-rang L
ONGYang-yang G
HAOXiang-yu S
IAOHui-juan J
INGChi-qiang X
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