Sciweavers

2409 search results - page 22 / 482
» On Extended Regular Expressions
Sort
View
DEBU
2007
83views more  DEBU 2007»
14 years 9 months ago
Regular Expression Matching for Multi-script Databases
Modern database systems mostly support representation and retrieval of data belonging to different scripts and different languages. But the database functions are mostly designed ...
Sudeshna Sarkar
FPGA
2009
ACM
285views FPGA» more  FPGA 2009»
15 years 4 months ago
PERG-Rx: a hardware pattern-matching engine supporting limited regular expressions
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...
Johnny Tsung Lin Ho, Guy G. Lemieux
KBSE
2009
IEEE
15 years 4 months ago
Reggae: Automated Test Generation for Programs Using Complex Regular Expressions
Abstract—Test coverage such as branch coverage is commonly measured to assess the sufficiency of test inputs. To reduce tedious manual efforts in generating high-covering test i...
Nuo Li, Tao Xie, Nikolai Tillmann, Jonathan de Hal...
FOSSACS
2008
Springer
14 years 11 months ago
Optimal Lower Bounds on Regular Expression Size Using Communication Complexity
The problem of converting deterministic finite automata into (short) regular expressions is considered. It is known that the required expression size is 2(n) in the worst case for ...
Hermann Gruber, Jan Johannsen
INFOCOM
2011
IEEE
14 years 1 months ago
Space-time tradeoff in regular expression matching with semi-deterministic finite automata
Abstract—Regular expression matching (REM) with nondeterministic finite automata (NFA) can be computationally expensive when a large number of patterns are matched concurrently....
Yi-Hua E. Yang, Viktor K. Prasanna