A delayed input DFA optimized algorithm of bounding default path

To improve the storage space of finite automata on regular expression matching, the paper researches the main idea of the delayed input DFA algorithm based on bounding default path, and analyses the algorithm problem when bounding small length default path. Then we propose optimized algorithm based on weight first principle and node first principle and assess them on the actual rule set, the results show that the optimized algorithm could effectively improve the compression ratio when the default path is bounded small.