On Non-overlapping Words

スポンサーリンク

概要

• 論文の詳細を見る

• 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.

• 2011-03-01

著者

• Kataoka Itaru

  School Of Science And Engineering Kokushikan University

• Moriya Tetsuo

  School Of Science And Engineering Kokushikan University

関連論文

• d-Primitive Words and D(1)-Concatenated Words
• Some Results on Primitive Words, Square-Free Words, and Disjunctive Languages
• On Non-overlapping Words
• A Note on Pcodes of Partial Words
• d-Primitive Words and Contextual Grammars

スポンサーリンク