An improved prefix-free regular-expression matching

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)


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
Issue number5
Publication statusPublished - 2013 Aug

All Science Journal Classification (ASJC) codes

  • Computer Science (miscellaneous)


Dive into the research topics of 'An improved prefix-free regular-expression matching'. Together they form a unique fingerprint.

Cite this