TY - JOUR
T1 - An improved prefix-free regular-expression matching
AU - Han, Yo Sub
N1 - Copyright:
Copyright 2013 Elsevier B.V., All rights reserved.
PY - 2013/8
Y1 - 2013/8
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=84887007937&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84887007937&partnerID=8YFLogxK
U2 - 10.1142/S0129054113500238
DO - 10.1142/S0129054113500238
M3 - Article
AN - SCOPUS:84887007937
VL - 24
SP - 679
EP - 687
JO - International Journal of Foundations of Computer Science
JF - International Journal of Foundations of Computer Science
SN - 0129-0541
IS - 5
ER -