This paper is devoted to finite state automata, regular expression matching, pattern recognition, and the exponential blow-up problem, which is the growing complexity of automata exponentially depending on regular expression length. This paper presents a theoretical and hardware solution to the exponential blow-up problem for some complicated classes of regular languages, which caused severe limitations in Network Intrusion Detection Systems work. The article supports the solution with theorems on correctness and complexity.

翻译：本文致力于研究有限状态自动机、正则表达式匹配、模式识别以及指数爆炸问题——即自动机复杂度随正则表达式长度呈指数级增长的问题。本文针对某些复杂正则语言类别中导致网络入侵检测系统工作受到严重限制的指数爆炸问题，提出了一种理论及硬件解决方案。文章通过正确性和复杂度定理为所提出的解决方案提供了理论支撑。