Novel NFA engine construction method of regular expressions
A novel method for constructing smaller non-deterministic finite automata (NFA) engine from given regular expressions named PFA was proposed.There are three main algorithms in PFA,the pretreatment algorithm,the coding parser tree algorithm and the NFA construction algorithm based on the coded binary...
Saved in:
| Main Authors: | Mao-hua JING, Yi-xian YANG, Tao WANG, Yang XIN |
|---|---|
| Format: | Article |
| Language: | zho |
| Published: |
Editorial Department of Journal on Communications
2014-10-01
|
| Series: | Tongxin xuebao |
| Subjects: | |
| Online Access: | http://www.joconline.com.cn/zh/article/doi/10.3969/j.issn.1000-436x.2014.10.012/ |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Similar Items
-
Highly Parallel Regular Expression Matching Using a Real Processing-in-Memory System
by: Jeonghyeon Joo, et al.
Published: (2025-01-01) -
Low-power TCAM for regular expression matching
by: Lin-xuan DING, et al.
Published: (2014-08-01) -
Helping tools for the regular expression author for test questions in LMS Moodle
by: O. A. Sychev, et al.
Published: (2016-07-01) -
Effects of aging on regular and express latencies of vergence
by: Qing Yang, et al.
Published: (2009-01-01) -
A data matching algorithm based on instruction pipeline
by: Yang Jiajia, et al.
Published: (2025-02-01)