136 search results - page 9 / 28 » Greedy Regular Expression Matching |
111
Voted
WIA
2009
Springer
15 years 8 months ago
2009
Springer
We continue our work [H. Gruber, M. Holzer: Provably shorter regular expressions from deterministic finite automata (extended ). In Proc. DLT, LNCS 5257, 2008] on the problem of ...
119
Voted
ISAAC
2003
Springer
15 years 7 months ago
2003
Springer
Abstract. We present a bit-parallel technique to search a text of length n for a regular expression of m symbols permitting k differences in worst case time O(mn/ logk s), where s...
108
click to vote
FPGA
2009
ACM
15 years 8 months ago
2009
ACM
PERG is a pattern matching engine designed for locating predefined byte string patterns (rules) from the ClamAV virus signature database in a data stream. This paper presents PERG...
140
click to vote
DBPL
2005
Springer
15 years 7 months ago
2005
Springer
Pattern matching mechanisms based on regular expressions feature in a number of recent languages for processing XML. The flexibility of these mechanisms demands novel approaches ...
127
click to vote
CCR
2010
14 years 11 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 ...