Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
From regular expressions to deterministic automata
Theoretical Computer Science
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A new approach to text searching
Communications of the ACM
Fast text searching: allowing errors
Communications of the ACM
Regular expressions into finite automata
Theoretical Computer Science
Experimental results on string matching algorithms
Software—Practice & Experience
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
A String Matching Algorithm Fast on the Average
Proceedings of the 6th Colloquium, on Automata, Languages and Programming
Translating Regular Expressions into Small epsilon-Free Nondeterministic Finite Automata
STACS '97 Proceedings of the 14th Annual Symposium on Theoretical Aspects of Computer Science
From Regular Expressions to DFA's Using Compressed NFA's
CPM '92 Proceedings of the Third Annual Symposium on Combinatorial Pattern Matching
A Bit-Parallel Approach to Suffix Automata: Fast Extended String Matching
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Compact DFA Representation for Fast Regular Expression Search
WAE '01 Proceedings of the 5th International Workshop on Algorithm Engineering
Regular Expression Searching over Ziv-Lempel Compressed Text
CPM '01 Proceedings of the 12th Annual Symposium on Combinatorial Pattern Matching
Approximate regular expression matching with multi-strings
SPIRE'11 Proceedings of the 18th international conference on String processing and information retrieval
A fast algorithm for approximate string matching on gene sequences
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
A unified construction of the glushkov, follow, and antimirov automata
MFCS'06 Proceedings of the 31st international conference on Mathematical Foundations of Computer Science
Hi-index | 0.00 |
We present a new algorithm to search regular expressions, which is able to skip text characters. The idea is to determine the minimum length l of a string matching the regular expression, manipulate the original automaton so that it recognizes all the reverse prefixes of length up to l of the strings accepted, and use it to skip text characters as done for exact string matching in previous work. As we show experimentally, the resulting algorithm is fast, the fastest one in many cases of interest.