Prefix-Free regular-expression matching

Authors:
Yo-Sub Han;Yajun Wang;Derick Wood
Affiliations:
Department of Computer Science, The Hong Kong University of Science and Technology;Department of Computer Science, The Hong Kong University of Science and Technology;Department of Computer Science, The Hong Kong University of Science and Technology
Venue:
CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
Year:
2005

Citing 10
Cited 7

Algorithms for finding patterns in strings

Handbook of theoretical computer science (vol. A)
On the use of regular expressions for searching text

ACM Transactions on Programming Languages and Systems (TOPLAS)
Automata for matching patterns

Handbook of formal languages, vol. 2
Deterministic generalized automata

Theoretical Computer Science
A fast string searching algorithm

Communications of the ACM
Efficient string matching: an aid to bibliographic search

Communications of the ACM
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Reporting Exact and Approximate Regular Expression Matches

CPM '98 Proceedings of the 9th Annual Symposium on Combinatorial Pattern Matching
Formal languages and their relation to automata

Formal languages and their relation to automata
The generalization of generalized automata: expression automata

CIAA'04 Proceedings of the 9th international conference on Implementation and Application of Automata

Intercode Regular Languages

Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

Fundamenta Informaticae
Overlap-Free regular languages

COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
A new linearizing restriction in the pattern matching problem

FCT'05 Proceedings of the 15th international conference on Fundamentals of Computation Theory
Outfix-free regular languages and prime outfix-free decomposition

ICTAC'05 Proceedings of the Second international conference on Theoretical Aspects of Computing
Intercode Regular Languages

Fundamenta Informaticae
Outfix-Free Regular Languages and Prime Outfix-Free Decomposition

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

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.