Real-time Regular Expression Matching
Formal Languages and Automata Theory
2023-08-22 v1 Computational Complexity
Computer Vision and Pattern Recognition
Discrete Mathematics
Abstract
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.
Cite
@article{arxiv.2308.10208,
title = {Real-time Regular Expression Matching},
author = {Alexandra Bernadotte},
journal= {arXiv preprint arXiv:2308.10208},
year = {2023}
}
Comments
17 pages, 11 figures