An improved prefix-free regular-expression matching

Research output: Contribution to journalArticle

1 Citation (Scopus)

Abstract

We revisit the regular-expression matching problem with respect to prefix-freeness of the pattern. It is known that a prefix-free pattern gives only a linear number of matching substrings in the size of an input text. We improve the previous algorithm and suggest an efficient algorithm that finds all pairs (start, end) of start and end positions of all matching substrings with a single scan of the input when the pattern is a prefix-free regular expression.

Original languageEnglish
Pages (from-to)679-687
Number of pages9
JournalInternational Journal of Foundations of Computer Science
Volume24
Issue number5
DOIs
Publication statusPublished - 2013 Aug 1

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)

Cite this

@article{18a587c937824498ae945dbeb8a43ed2,
title = "An improved prefix-free regular-expression matching",
abstract = "We revisit the regular-expression matching problem with respect to prefix-freeness of the pattern. It is known that a prefix-free pattern gives only a linear number of matching substrings in the size of an input text. We improve the previous algorithm and suggest an efficient algorithm that finds all pairs (start, end) of start and end positions of all matching substrings with a single scan of the input when the pattern is a prefix-free regular expression.",
author = "Yo-Sub Han",
year = "2013",
month = "8",
day = "1",
doi = "10.1142/S0129054113500238",
language = "English",
volume = "24",
pages = "679--687",
journal = "International Journal of Foundations of Computer Science",
issn = "0129-0541",
publisher = "World Scientific Publishing Co. Pte Ltd",
number = "5",

}

An improved prefix-free regular-expression matching. / Han, Yo-Sub.

In: International Journal of Foundations of Computer Science, Vol. 24, No. 5, 01.08.2013, p. 679-687.

Research output: Contribution to journalArticle

TY - JOUR

T1 - An improved prefix-free regular-expression matching

AU - Han, Yo-Sub

PY - 2013/8/1

Y1 - 2013/8/1

N2 - We revisit the regular-expression matching problem with respect to prefix-freeness of the pattern. It is known that a prefix-free pattern gives only a linear number of matching substrings in the size of an input text. We improve the previous algorithm and suggest an efficient algorithm that finds all pairs (start, end) of start and end positions of all matching substrings with a single scan of the input when the pattern is a prefix-free regular expression.

AB - We revisit the regular-expression matching problem with respect to prefix-freeness of the pattern. It is known that a prefix-free pattern gives only a linear number of matching substrings in the size of an input text. We improve the previous algorithm and suggest an efficient algorithm that finds all pairs (start, end) of start and end positions of all matching substrings with a single scan of the input when the pattern is a prefix-free regular expression.

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

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

U2 - 10.1142/S0129054113500238

DO - 10.1142/S0129054113500238

M3 - Article

VL - 24

SP - 679

EP - 687

JO - International Journal of Foundations of Computer Science

JF - International Journal of Foundations of Computer Science

SN - 0129-0541

IS - 5

ER -