206 search results - page 16 / 42 » Deterministic Caterpillar Expressions |
INFOCOM
2011
IEEE
13 years 1 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
2007
ACM
14 years 1 months ago
2007
ACM
The importance of network security has grown tremendously and a collection of devices have been introduced, which can improve the security of a network. Network intrusion detectio...
ANCS
2007
ACM
14 years 1 months ago
2007
ACM
Modern network intrusion detection systems need to perform regular expression matching at line rate in order to detect the occurrence of critical patterns in packet payloads. Whil...
LICS
2009
IEEE
14 years 4 months ago
2009
IEEE
Weighted automata are nondeterministic automata with numerical weights on transitions. They can define quantitative languages L that assign to each word w a real number L(w). In ...
FSTTCS
2010
Springer
13 years 7 months ago
2010
Springer
The parity acceptance condition for -regular languages is a special case of the Rabin and Streett acceptance conditions. While the parity acceptance condition is as expressive as ...