Sciweavers

COCOON
2006
Springer
13 years 9 months ago
Overlap-Free Regular Languages
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...
Yo-Sub Han, Derick Wood