@inproceedings{e12c3b535ebd4071bb710f96e66a2bea,
title = "Overlap-free regular languages",
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 overlapfreeness 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.",
author = "Han, {Yo Sub} and Derick Wood",
year = "2006",
doi = "10.1007/11809678_49",
language = "English",
isbn = "3540369252",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "469--478",
booktitle = "Computing and Combinatorics - 12th Annual International Conference, COCOON 2006, Proceedings",
address = "Germany",
note = "12th Annual International Conference on Computing and Combinatorics, COCOON 2006 ; Conference date: 15-08-2006 Through 18-08-2006",
}