Prefix-free regular languages and pattern matching

Authors:
Yo-Sub Han;Yajun Wang;Derick Wood
Affiliations:
Intelligence and Interaction Research Center, Korea Institute of Science and Technology, P.O. Box 131, Cheongnyang, Seoul, Republic of Korea;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong;Department of Computer Science, The Hong Kong University of Science and Technology, Clear Water Bay, Kowloon, Hong Kong
Venue:
Theoretical Computer Science
Year:
2007

Citing 12
Cited 3

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)
Regular languages

Handbook of formal languages, vol. 1
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
ISO-IEC 9945-2: IEEE Std. 1003.2-1992 Information Technology - Portable Operating System Interface: Shell and Utilities

ISO-IEC 9945-2: IEEE Std. 1003.2-1992 Information Technology - Portable Operating System Interface: Shell and Utilities
Theory of Codes

Theory of Codes
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

Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Fundamenta Informaticae
On nondeterministic workflow executions

WS-FM'10 Proceedings of the 7th international conference on Web services and formal methods
Nondeterministic State Complexity of Basic Operations for Prefix-Free Regular Languages

Fundamenta Informaticae

Quantified Score

Hi-index	5.23

Visualization

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.