Regular Section
On Non-overlapping Words
2011 Volume E94.D Issue 3 Pages 707-709
Details
2011 Volume E94.D Issue 3 Pages 707-709
Let Q be the set of all primitive words over a finite alphabet having at least two letters. In this paper, we study the language D(1) of all non-overlapping (d-primitive) words, which is a proper subset of Q. We show that D(1) is a context-sensitive langauage but not a deterministic context-free language. Further it is shown that [D(1)]n is not regular for n ≥ 1.
