Algorithms for finding patterns in strings
Handbook of theoretical computer science (vol. A)
A Four Russians algorithm for regular expression pattern matching
Journal of the ACM (JACM)
A subquadratic algorithm for approximate regular expression matching
Journal of Algorithms
Fast text searching for regular expressions or automaton searching on tries
Journal of the ACM (JACM)
From regular expressions to DFA's using compressed NFA's
Theoretical Computer Science
Pattern matching algorithms
Introduction To Automata Theory, Languages, And Computation
Introduction To Automata Theory, Languages, And Computation
An Automata-Based Recognition Algorithm for Semi-extended Regular Expressions
MFCS '00 Proceedings of the 25th International Symposium on Mathematical Foundations of Computer Science
| Hi-index | 0.00 |
This paper is concerned with the recognition problem for extended regular expressions: given an extended regular expression r of length m and an input string x of length n, determine if x ∈ L(r), where L(r) denotes the language denoted by r. For this problem, the algorithm based on dynamic programming which runs in O(mn3) time and O(mn2) space is widely known. We here introduce a structure called a modular tree and present a new automata-based recognition algorithm such that it runs in O(mn2 +kn3) time and O(mn+kn2) space. Here k is a number derived from a modular tree and is less than the number of intersection and complement operators in r. Furthermore, k can be much smaller than m for many extended regular expressions. Thus our algorithm significantly improves the time and space complexities of the classical dynamic programming algorithm.