Prefix-free regular languages and pattern matching

Yo Sub Han; Yajun Wang; Derick Wood

doi:10.1016/j.tcs.2007.10.017

Prefix-free regular languages and pattern matching

Yo Sub Han, Yajun Wang, Derick Wood

Department of Computer Science

Research output: Contribution to journal › Article › peer-review

7 Citations (Scopus)

Abstract

We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free.

Original language	English
Pages (from-to)	307-317
Number of pages	11
Journal	Theoretical Computer Science
Volume	389
Issue number	1-2
DOIs	https://doi.org/10.1016/j.tcs.2007.10.017
Publication status	Published - 2007 Dec 10

Bibliographical note

Funding Information:
We wish to thank the referee for the careful reading of the paper and the many valuable suggestions. Han was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E and the KIST Tangible Space Initiative Grant. Wang was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6206/02E. Wood was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E.

All Science Journal Classification (ASJC) codes

Theoretical Computer Science
Computer Science(all)

Access to Document

10.1016/j.tcs.2007.10.017

Fingerprint Dive into the research topics of 'Prefix-free regular languages and pattern matching'. Together they form a unique fingerprint.

Cite this

@article{a02fe5c64bc142c7a986d4cf731af6b2,

title = "Prefix-free regular languages and pattern matching",

abstract = "We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free.",

author = "Han, {Yo Sub} and Yajun Wang and Derick Wood",

note = "Funding Information: We wish to thank the referee for the careful reading of the paper and the many valuable suggestions. Han was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E and the KIST Tangible Space Initiative Grant. Wang was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6206/02E. Wood was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E.",

year = "2007",

month = dec,

day = "10",

doi = "10.1016/j.tcs.2007.10.017",

language = "English",

volume = "389",

pages = "307--317",

journal = "Theoretical Computer Science",

issn = "0304-3975",

publisher = "Elsevier",

number = "1-2",

}

TY - JOUR

T1 - Prefix-free regular languages and pattern matching

AU - Han, Yo Sub

AU - Wang, Yajun

AU - Wood, Derick

N1 - Funding Information: We wish to thank the referee for the careful reading of the paper and the many valuable suggestions. Han was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E and the KIST Tangible Space Initiative Grant. Wang was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6206/02E. Wood was supported by the Research Grants Council of Hong Kong Competitive Earmarked Research Grant HKUST6197/01E.

PY - 2007/12/10

Y1 - 2007/12/10

N2 - We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free.

AB - We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We prove that a prefix-free regular expression gives only a linear number of matching substrings in the size of a given text. Based on this observation, we propose an efficient algorithm for the prefix-free regular-expression matching problem. Furthermore, we suggest an algorithm to determine whether or not a given regular language is prefix-free.

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

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

U2 - 10.1016/j.tcs.2007.10.017

DO - 10.1016/j.tcs.2007.10.017

M3 - Article

AN - SCOPUS:36149000603

VL - 389

SP - 307

EP - 317

JO - Theoretical Computer Science

JF - Theoretical Computer Science

SN - 0304-3975

IS - 1-2

ER -