Overlap-Free regular languages

Authors:
Yo-Sub Han;Derick Wood
Affiliations:
System Technology Division, Korea Institute of Science and Technology, Cheongryang, Seoul, Korea;Department of Computer Science, The Hong Kong University of Science, and Technology, Kowloon, Hong Kong SAR
Venue:
COCOON'06 Proceedings of the 12th annual international conference on Computing and Combinatorics
Year:
2006

Citing 13
Cited 2

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)
Codes

Handbook of formal languages, vol. 1
Derivatives of Regular Expressions

Journal of the ACM (JACM)
Programming Techniques: Regular expression search algorithm

Communications of the ACM
Introduction to Algorithms

Introduction to Algorithms
Factorizations of languages and commutativity conditions

Acta Cybernetica
On the Decomposition of Finite Languages

On the Decomposition of Finite Languages
Formal languages and their relation to automata

Formal languages and their relation to automata
Prefix-Free regular-expression matching

CPM'05 Proceedings of the 16th annual conference on Combinatorial Pattern Matching
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
Shorter regular expressions from finite-state automata

CIAA'05 Proceedings of the 10th international conference on Implementation and Application of Automata

Intercode Regular Languages

Fundamenta Informaticae
Intercode Regular Languages

Fundamenta Informaticae

Quantified Score

Hi-index	0.00

Visualization

Abstract

We define a language to be overlap-free if any two distinct strings in the language do not overlap with each other. We observe that overlap-free languages are a proper subfamily of infix-free languages and also a proper subfamily of comma-free languages. Based on these observations, we design a polynomial-time algorithm that determines overlap-freeness of a regular language. We consider two cases: A language is specified by a nondeterministic finite-state automaton and a language is described by a regular expression. Furthermore, we examine the prime overlap-free decomposition of overlap-free regular languages and show that the prime overlap-free decomposition is not unique.