New algorithms for regular expression matching

Authors:
Philip Bille
Affiliations:
The IT University of Copenhagen, Copenhagen S, Denmark
Venue:
ICALP'06 Proceedings of the 33rd international conference on Automata, Languages and Programming - Volume Part I
Year:
2006

Citing 7
Cited 9

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
A Four Russians algorithm for regular expression pattern matching

Journal of the ACM (JACM)
A new approach to text searching

Communications of the ACM
A fast bit-vector algorithm for approximate string matching based on dynamic programming

Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Deterministic dictionaries

Journal of Algorithms
Introduction to Algorithms

Introduction to Algorithms

Fast and compact regular expression matching

Theoretical Computer Science
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

ACM Transactions on Algorithms (TALG)
Regular expression matching with multi-strings and intervals

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Fast bit-parallel matching for network and regular expressions

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
String matching with variable length gaps

SPIRE'10 Proceedings of the 17th international conference on String processing and information retrieval
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

IWOCA'10 Proceedings of the 21st international conference on Combinatorial algorithms
Faster bit-parallel algorithms for unordered pseudo-tree matching and tree homeomorphism

Journal of Discrete Algorithms
String matching with variable length gaps

Theoretical Computer Science
Improved approximate string matching and regular expression matching on Ziv-Lempel compressed texts

CPM'07 Proceedings of the 18th annual conference on Combinatorial Pattern Matching

Quantified Score

Hi-index	0.00

Visualization

Abstract

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 ≥log2n, we obtain the fastest known algorithms, regardless of how much space is used.