Real-time Regular Expression Matching
This addresses performance bottlenecks in Network Intrusion Detection Systems, though it appears incremental as it focuses on specific language classes.
The paper tackled the exponential blow-up problem in finite state automata for regular expression matching, which limited Network Intrusion Detection Systems, by presenting a theoretical and hardware solution for some complicated classes of regular languages, supported by theorems on correctness and complexity.
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.