14 search results - page 3 / 3 » From Regular Expressions to DFA's Using Compressed NFA's |
CONEXT
2007
ACM
14 years 1 months ago
2007
ACM
Deterministic finite automata (DFAs) are widely used to perform regular expression matching in linear time. Several techniques have been proposed to compress DFAs in order to redu...
CPM
2005
Springer
14 years 3 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...
CPM
1992
Springer
14 years 1 months ago
1992
Springer
VLDB
2001
ACM
14 years 2 months ago
2001
ACM
We propose an novel method of computing and storing DataCubes. Our idea is to use Bayesian Networks, which can generate approximate counts for any query combination of attribute v...