New Algorithms for Regular Expression Matching
In this paper we revisit the classical regular expression matching problem, namely, given a regular expression R and a string Q consisting of m and n symbols, respectively, decide if Q matches one of the strings specified by R. We present new algorithms designed for a standard unit-cost RAM with word length w ≥logn. We improve the best known time bounds for algorithms that use O(m) space, and whenever w ≥log2 n, we obtain the fastest known algorithms, regardless of how much space is used.
KeywordsWord Length Regular Expression Parse Tree Topological Order Outgoing Transition
Unable to display preview. Download preview PDF.
- 1.Aho, A.V., Sethi, R., Ullman, J.D.: Compilers: principles, techniques, and tools. Addison-Wesley Longman Publishing Co., Inc., Boston (1986)Google Scholar
- 3.Bille, P., Farach-Colton, M.: Fast and compact regular expression matching, Submitted to a journal (2005), preprint availiable at, arxiv.org/cs/0509069