141 search results - page 1 / 29 » Explicitly Parallel Regular Expressions |
IMSCCS
2006
IEEE
13 years 10 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...
CCR
2010
13 years 1 months ago
2010
This paper presents iNFAnt, a parallel engine for regular expression pattern matching. In contrast with traditional approaches, iNFAnt adopts non-deterministic automata, allowing ...
CORR
2010
Springer
13 years 2 months ago
2010
Springer
ISCAPDCS
2007
13 years 6 months ago
2007
—The tremendous growth in the information culture, efficient digital searches are needed to extract and identify information from huge data. The notion that evolution in silicon ...
SPIRE
2010
Springer
13 years 2 months ago
2010
Springer
Abstract. In this paper, we extend the SHIFT-AND approach by BaezaYates and Gonnet (CACM 35(10), 1992) to the matching problem for network expressions, which are regular expression...