141 search results - page 6 / 29 » An Algorithm for Transformation of Finite Automata to Regula... |
ACL
1997
13 years 10 months ago
1997
This paper presents an algorithm for the compilation of regular formalisms with rule features into finite-state automata. Rule features are incorporated into the right context of ...
DLT
2009
13 years 6 months ago
2009
Abstract. We improve on some recent results on lower bounds for conversion problems for regular expressions. In particular we consider the conversion of planar deterministic finite...
IJAC
2007
13 years 8 months ago
2007
There exist two well-known quotients of the position automaton of a regular expression. The first one, called the equation automaton, has first been introduced by Mirkin from th...
ANCS
2009
ACM
13 years 6 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...
RECONFIG
2008
IEEE
14 years 2 months ago
2008
IEEE
—We present algorithms for implementing large-scale regular expression matching (REM) on FPGA. Based on the proposed algorithms, we develop tools that first transform regular ex...