Efficient i-DFA construction algorithm based on state grouping
Regular expression matching plays an important role in many network and security applications.DFA is the preferred representation to perform regular expression matching in high-speed network,because of its high and stable matching efficiency.However,DFA may experience state explosion,and thus consum...
Saved in:
Main Authors: | Deng-ke QIAO, Qing WANG, Ting-wen LIU, Yong SUN, Li GUO |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2013-08-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2013.08.014/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Improved DFA algorithm based on multi-dimensional finite automata
by: ONGYang-yang G, et al.
Published: (2015-05-01) -
States constrain-based algorithm for large scale regular expression matching
by: Wei HE, et al.
Published: (2013-10-01) -
Politics in States and Communities /
by: Dye, Thomas R.
Published: (1977) -
State and Local Government /
by: Bowman, Ann O'M., 1948-
Published: (2002) -
Automatic Generation of Moodle Cloze Questions for the Assessment of Knowledge About Lexical Analysis Algorithms
by: Roberto Izquierdo-Amo, et al.
Published: (2025-01-01)