A new linearizing restriction in the pattern matching problem

Yo Sub Han, Derick Wood

Research output: Contribution to journalConference article

1 Citation (Scopus)

Abstract

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 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 when the pattern is a regular language according to the new match rule.

Original languageEnglish
Pages (from-to)552-562
Number of pages11
JournalLecture Notes in Computer Science
Volume3623
Publication statusPublished - 2005 Oct 24

Fingerprint

Formal languages
Pattern matching
Pattern Matching
Matching Problem
Semantics
Restriction
Regular Languages
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

@article{05292c470cd64e4a9bbb3b9a2e126fe2,
title = "A new linearizing restriction in the pattern matching problem",
abstract = "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 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 when the pattern is a regular language according to the new match rule.",
author = "Han, {Yo Sub} and Derick Wood",
year = "2005",
month = "10",
day = "24",
language = "English",
volume = "3623",
pages = "552--562",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

A new linearizing restriction in the pattern matching problem. / Han, Yo Sub; Wood, Derick.

In: Lecture Notes in Computer Science, Vol. 3623, 24.10.2005, p. 552-562.

Research output: Contribution to journalConference article

TY - JOUR

T1 - A new linearizing restriction in the pattern matching problem

AU - Han, Yo Sub

AU - Wood, Derick

PY - 2005/10/24

Y1 - 2005/10/24

N2 - 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 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 when the pattern is a regular language according to the new match rule.

AB - 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 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 when the pattern is a regular language according to the new match rule.

UR - http://www.scopus.com/inward/record.url?scp=26844547510&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=26844547510&partnerID=8YFLogxK

M3 - Conference article

VL - 3623

SP - 552

EP - 562

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -