Prefix-free regular-expression matching

Yo-Sub Han, Yajun Wang, Derick Wood

Research output: Contribution to journalConference article

7 Citations (Scopus)

Abstract

We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only 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)298-309
Number of pages12
JournalLecture Notes in Computer Science
Volume3537
Publication statusPublished - 2005 Oct 17
EventOt16th Annual Symposium on Combinatorial Pattern Matching, CPM 2005 - Jeju Island, Korea, Republic of
Duration: 2005 Jun 192005 Jun 22

Fingerprint

Prefix-free
Regular Expressions
Matching Problem
Formal languages
Regular Languages
Prefix
Efficient Algorithms

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

Cite this

Han, Yo-Sub ; Wang, Yajun ; Wood, Derick. / Prefix-free regular-expression matching. In: Lecture Notes in Computer Science. 2005 ; Vol. 3537. pp. 298-309.
@article{08ef6577f83e4d1fafa7145ad91884e9,
title = "Prefix-free regular-expression matching",
abstract = "We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only 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 = "Yo-Sub Han and Yajun Wang and Derick Wood",
year = "2005",
month = "10",
day = "17",
language = "English",
volume = "3537",
pages = "298--309",
journal = "Lecture Notes in Computer Science",
issn = "0302-9743",
publisher = "Springer Verlag",

}

Han, Y-S, Wang, Y & Wood, D 2005, 'Prefix-free regular-expression matching', Lecture Notes in Computer Science, vol. 3537, pp. 298-309.

Prefix-free regular-expression matching. / Han, Yo-Sub; Wang, Yajun; Wood, Derick.

In: Lecture Notes in Computer Science, Vol. 3537, 17.10.2005, p. 298-309.

Research output: Contribution to journalConference article

TY - JOUR

T1 - Prefix-free regular-expression matching

AU - Han, Yo-Sub

AU - Wang, Yajun

AU - Wood, Derick

PY - 2005/10/17

Y1 - 2005/10/17

N2 - We explore the regular-expression matching problem with respect to prefix-freeness of the pattern. We show that the prefix-free regular expression gives only 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 show that the prefix-free regular expression gives only 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=26444504118&partnerID=8YFLogxK

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

M3 - Conference article

AN - SCOPUS:26444504118

VL - 3537

SP - 298

EP - 309

JO - Lecture Notes in Computer Science

JF - Lecture Notes in Computer Science

SN - 0302-9743

ER -