Syntactic Congruences of Codes

スポンサーリンク

概要

• 論文の詳細を見る

• We consider syntactic congruences of some codes. As a main result, for an infix code L, it is proved that the following (i) and (ii) are equivalent and that (iii) implies (i), where P_L is the syntactic congruence of L. (i) L is a P_<L^2>-class. (ii) L^m is a P_<L^k>-class, for given two integers m and k with 1 ≤ m ≤ k. (iii)L^* is a P_<L^*>-class. Next we show that every (i), (ii) and (iii) holds for a strongly infix code L. Moreover we consider properties of syntactic conguences of a residue W(L) for a strongly outfix code L.

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

著者

• Kataoka I

  Department Of Electrical Engineering Faculty Of Engineering Kokushikan University

• Moriya T

  Kokushikan Univ. Tokyo Jpn

• Moriya Tetsuo

  Department Of Electrical Engineering Faculty Of Engineering Kokushikan University

• KATAOKA Itaru

  Department of Electrical Engineering, Faculty of Engineering, Kokushikan University

• Kataoka Itaru

  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

スポンサーリンク