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 | |
| Publication status | Published - 2007 Dec 10 |
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
Han, Y. S., Wang, Y., & Wood, D. (2007). Prefix-free regular languages and pattern matching. Theoretical Computer Science, 389(1-2), 307-317. https://doi.org/10.1016/j.tcs.2007.10.017