Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Mastering regular expressions
Handbook of formal languages, vol. 1
Automata for matching patterns
Handbook of formal languages, vol. 2
Programming Techniques: Regular expression search algorithm
Communications of the ACM
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
The Membership Problem for Regular Expressions with Intersection Is Complete in LOGCFL
STACS '02 Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science
Word problems requiring exponential time(Preliminary Report)
STOC '73 Proceedings of the fifth annual ACM symposium on Theory of computing
A New Recognition Algorithm for Extended Regular Expressions
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
An effective algorithm for the membership problem for extended regular expressions
FOSSACS'07 Proceedings of the 10th international conference on Foundations of software science and computational structures
Towards knowledge extraction from weblogs and rule-based semantic querying
RuleML'07 Proceedings of the 2007 international conference on Advances in rule interchange and applications
| Hi-index | 0.00 |
Extended regular expressions are an extension of ordinary regular expressions by the operations of intersection and complement. We give new algorithms for extended regular expression matching and searching which improve significantly the (very old) best upper bound for this problem, due to Hopcroft and Ullman. For an extended regular expression of size m with p intersection and complement operators and an input word of length n our algorithms run in time O(mn2) and space O(pn2) while the one of Hopcroft and Ullman runs in time O(mn3) and space O(mn2). Since the matching problem for semiextended regular expressions (only intersection is added) has been very recently shown to be LOGCFL complete, our algorithms are very likely the best one can expect. We also emphasize the importance of the extended regular expressions for software programs currently using ordinary regular expressions and show how the algorithms presented can be improved to run significantly faster in practical applications.