Compression algorithm of state transition table based on sparse matrix
Gou Cheng-cheng · Journal of Computer Applications · 2010
Regular expression matching is essential for network security applications.In this paper a smi-SCT State transition Compressed Table of sparse matrix index algorithm was proposed.Firstly a sparse matrix and index table were introduced into Deterministic Finite Automaton DFA with a general create method of them.Then combined with the smi-SCT with alphabet compression table algorithm an optimization strategy of the algorithm was given.At last proved the compression effect of smi-SCT and gave the applicable scope of smi-SCT according to the experimental results on compression effects.