206 search results - page 5 / 42 » Regular Expressions into Finite Automata |
ANCS
2009
ACM
13 years 5 months ago
2009
ACM
Pattern matching is the most computation intensive task of a network intrusion detection system (NIDS). In this paper we present a hardware architecture to speed up the pattern mat...
ANCS
2007
ACM
13 years 11 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...
LATA
2010
Springer
14 years 4 months ago
2010
Springer
This paper presents a new polynomial-time algorithm for the inclusion problem for certain pairs of regular expressions. The algorithm is not based on construction of finite automat...
FSMNLP
2005
Springer
14 years 27 days ago
2005
Springer
We extend finite state registered automata (FSRA) to account for medium-distance dependencies in natural languages. We provide an extended regular expression language whose expres...
DLT
2010
13 years 8 months ago
2010
The partial derivative automaton (Apd) is usually smaller than other non-deterministic finite automata constructed from a regular expression, and it can be seen as a quotient of th...