14 search results - page 1 / 3 » From Regular Expressions to DFA's Using Compressed NFA's |
INFOCOM
2011
IEEE
13 years 2 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....
IMSCCS
2006
IEEE
14 years 4 months ago
2006
IEEE
The equivalence of non-deterministic finite automata (NFA1 ), deterministic finite automata (DFA), regular expressions (RE), and parallel finite automata (PFA) with augmented r...
IPPS
2010
IEEE
13 years 8 months ago
2010
IEEE
Regular Expressions (RegExes) are widely used in various applications to identify strings of text. Their flexibility, however, increases the complexity of the detection system and ...
ICC
2011
IEEE
12 years 10 months ago
2011
IEEE
—Regular expression matching has become a critical yet challenging technique in content-aware network processing, such as application identification and deep inspection. To meet ...
WAE
2001
14 years 6 days ago
2001
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...