63 search results - page 4 / 13 » Minimizing NFA's and Regular Expressions |
FPL
2006
Springer
14 years 7 days ago
2006
Springer
The use of reconfigurable hardware for network security applications has recently made great strides as FPGA devices have provided larger and faster resources. Regular expressions...
WAE
2001
13 years 10 months ago
2001
We present a new technique to encode a deterministic nite automaton (DFA). Based on the speci c properties of Glushkov's nondeterministic nite automaton (NFA) construction alg...
CPM
2005
Springer
14 years 2 months ago
2005
Springer
Abstract. The efficiency of regular expression matching algorithms depends very much on the size of the nondeterministic finite automata (NFA) obtained from regular expressions. R...
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...
STACS
2005
Springer
14 years 2 months ago
2005
Springer
