Introduction to algorithms
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Improved Algorithm for the Membership Problem for Extended Regular Expressions
MFCS '02 Proceedings of the 27th International Symposium on Mathematical Foundations of Computer Science
Fast Algorithms for Extended Regular Expression Matching and Searching
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
A New Recognition Algorithm for Extended Regular Expressions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
A fast bit-parallel algorithm for matching extended regular expressions
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Testing extended regular language membership incrementally by rewriting
RTA'03 Proceedings of the 14th international conference on Rewriting techniques and applications
Succinctness of the Complement and Intersection of Regular Expressions
ACM Transactions on Computational Logic (TOCL)
| Hi-index | 0.00 |
By adding the complement operator (¬), extended regular expressions (ERE) can encode regular languages non-elementarily more succinctly than regular expressions. The ERE membership problem asks whether a word w of size n belongs to the language of an ERE R of size m. Unfortunately, the best known membership algorithms are either non-elementary in m or otherwise require space Ω(n2) and time Ω(n3); since in many practical applications n can be very large, these space and time requirements could be prohibitive. In this paper we present an ERE membership algorithm that runs in space O(nċ (log n+m) ċ2m) and time O(n2 ċ (log n + m) ċ 2m)ċ The presented algorithm outperforms the best known algorithms when n is exponentially larger than m.