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)
On the use of regular expressions for searching text
ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata for matching patterns
Handbook of formal languages, vol. 2
A fast string searching algorithm
Communications of the ACM
Efficient string matching: an aid to bibliographic search
Communications of the ACM
Programming Techniques: Regular expression search algorithm
Communications of the ACM
ISO-IEC 9945-2: IEEE Std. 1003.2-1992 Information Technology - Portable Operating System Interface: Shell and Utilities
Reporting Exact and Approximate Regular Expression Matches
CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Prefix-Free regular-expression matching
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Overlap-Free regular languages
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
| Hi-index | 0.00 |
In the pattern matching problem, there can be a quadratic number of matching substrings in the size of a given text. The linearizing restriction finds, at most, a linear number of matching substrings. We first explore two well-known linearizing restriction rules, the longest-match rule and the shortest-match substring searchrule, and show that both rules give the same result when a pattern is an infix-free set even though they have different semantics. Then, we introduce a new linearizing restriction, the leftmost non-overlapping match rule that is suitable for find-and-replace operations in text searching, and propose an efficient algorithm when the pattern is a regular language according to the new match rule.