A Note on Parses of Codes(Theory of Automata, Formal Language Theory)

スポンサーリンク

概要

• 論文の詳細を見る

• In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.

• 社団法人電子情報通信学会の論文
• 2003-11-01

著者

• Moriya Tetsuo

  Department Of Electrical Engineering Faculty Of Engineering Kokushikan University

• Moriya Tetsuo

  Department Of Applied Physics Faculty Of Engineering University Of Tokyo

関連論文

• 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

スポンサーリンク