Improved DFA algorithm based on multi-dimensional finite automata
Compiling multiple regular expression signatures into a combined DFA can blowup in state and storage space.Explanations from the prospective of information theory and multi-dimensional mathematical model were proposed fo-cusing on the most serious state explosion.Redundancy states were divided into...
Saved in:
Main Authors: | ONGYang-yang G, IUQin-rang L, ANGZhen-xi Y, HAOXiang-yu S, INGChi-qiang X, IAOHui-juan J, ENGZhi-bin P |
---|---|
Format: | Article |
Language: | zho |
Published: |
Editorial Department of Journal on Communications
2015-05-01
|
Series: | Tongxin xuebao |
Subjects: | |
Online Access: | http://www.joconline.com.cn/zh/article/doi/10.11959/j.issn.1000-436x.2015101/ |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
States constrain-based algorithm for large scale regular expression matching
by: Wei HE, et al.
Published: (2013-10-01) -
Efficient i-DFA construction algorithm based on state grouping
by: Deng-ke QIAO, et al.
Published: (2013-08-01) -
Weak gardens of Eden for 1-dimensional tessellation automata
by: Michael D. Taylor
Published: (1985-01-01) -
Are rare earth stocks efficient? Novel insights using asymmetric MF-DFA
by: Pengbo Wan, et al.
Published: (2025-01-01) -
Automata and computability /
by: Kozen, Dexter C.
Published: (1997)