Prefix-free regular languages and pattern matching

Yo Sub Han, Yajun Wang, Derick Wood

Research output: Contribution to journalArticlepeer-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 languageEnglish
Pages (from-to)307-317
Number of pages11
JournalTheoretical Computer Science
Volume389
Issue number1-2
DOIs
Publication statusPublished - 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)

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

Cite this