中文摘要：

对正则表达式集合进行分组是解决DFA状态膨胀问题的一种重要方法．已有的分组算法大都是启发式的或蛮力的，分组效果很差．分析了DFA状态膨胀的原因，总结了某些正则表达式间的冲突状况．证明了当冲突非负和冲突独立时，正则表达式集合的最优k分组问题可归结为最大k割问题，从而说明该问题是NP-Hard的基于局部搜索的思想，提出了一种分组算法GRELS来解决分组问题，并证明对最大k割问题，该算法的近似比是1／（1—1／k）．与已有的分组算法相比，当分组数目相同时，GRELS算法分组结果的状态总数最少，并且集合发生变化时所需的更新时间最短．

英文摘要：

Dividing regular expression sets into multiple groups is an important process to solve the problem of DFA state explosion. Previous grouping algorithms are heuristic or are done by brute-force, which have poor grouping results. This paper analyzes the reasons of states explosion and summarizes conflicting relationship among regular expressions of some types. When conflicts are non-negative and independent, the optimum k-grouping problem of regular expression sets can be reduced to the maximum k-cut problem, which is NP-hard. Based on the idea of local searching, a new grouping algorithm named GRELS is introduced to solve the problem efficiently, which is 1/（1-1/k） -approximation for maximum k-cut problem. Comparing with previous grouping algorithms, GRELS has the minimum number of states for the same number of groups, and requires the least time to update grouping results when pattern sets change.