On the Linear Number of Matching Substrings

We study the number of matching substrings in the pattern matching problem. in general, there can be a quadratic number of matching substrings in the size of a given text. the linearizing restriction enables to find 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 search rule, 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 for the new rule when a pattern is described by a regular expression. we also examine the problem of obtaining the maximal number of non-overlapping matching substrings.