A Note 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. First we show that D(1) is a context-free language, and next we present a necessary and sufficient condition for a morphism to preserve the d-primitivity. Last we investigate a condition of disjunctiveness for a language.

• 一般社団法人電子情報通信学会の論文
• 2006-11-27

著者

• Moriya Tetsuo

  Department Of Applied Physics Faculty Of Engineering University Of Tokyo

• Moriya Tetsuo

  Department of Electrical Engineering, Faculty of Engineering Kokushikan University

関連論文

• Syntactic Congruences of Codes
• A Class by Principal Congruence of a Syntactically Embedded Language(Automata and Formal Language Theory)
• A note on d-primitive words, cyclic-square-free words, and disjunctive languages(Algorithmic problems in algebra, languages and computation systems)
• A Note on Parses of Codes(Theory of Automata, Formal Language Theory)
• Power-Properties of Codes
• A Note on Parses of Codes
• Role of Field-Induced-Surface Current in the Landau Diamagnetism
• A Note on non-overlapping words

スポンサーリンク