206 search results - page 3 / 42 » Regular Expressions into Finite Automata |
INFOCOM
2011
IEEE
12 years 11 months ago
2011
IEEE
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Although Regular Expressions (RegExes) have been widely used in network security applications, their inherent complexity often limits the total number of RegExes that can be detec...
LATIN
1992
Springer
13 years 11 months ago
1992
Springer
DLT
2008
13 years 8 months ago
2008
VLSISP
2008
13 years 7 months ago
2008
In this paper we describe a regular expression pattern matching approach for reconfigurable hardware. Following a Non-deterministic Finite Automata direction, we introduce three ne...