Titlebook: Algorithm Engineering; 5th International Wo Gerth St?lting Brodal,Daniele Frigioni,Alberto Mar Conference proceedings 2001 Springer-Verlag

PHON

Compact DFA Representation for Fast Regular Expression Search,tomaton (NFA) construction algorithm, we are able to encode the DFA using (.+ 1)(2. + |Σ|) bits, where . is the number of characters (excluding operator symbols) in the regular expression and Σ is the alphabet. This compares favorably against the worst case of (. + 1)2.|Σ| bits needed by a classical

動(dòng)物

愚蠢人