Syntactic Congruences of Codes

Tetsuo MORIYA; Itaru KATAOKA

Syntactic Congruences of Codes

Tetsuo MORIYA, Itaru KATAOKA

Full Text Views

0

Cite this

Summary :

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

Publication: IEICE TRANSACTIONS on Information Vol.E84-D No.3 pp.415-418

Publication Date: 2001/03/01

Publicized

Online ISSN

DOI

Type of Manuscript: LETTER

Category: Theory of Automata, Formal Language Theory

Cite this

Copy

Tetsuo MORIYA, Itaru KATAOKA, "Syntactic Congruences of Codes" in IEICE TRANSACTIONS on Information, vol. E84-D, no. 3, pp. 415-418, March 2001, doi: .
Abstract: 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²-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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e84-d_3_415/_p

Copy

@ARTICLE{e84-d_3_415,
author={Tetsuo MORIYA, Itaru KATAOKA, },
journal={IEICE TRANSACTIONS on Information},
title={Syntactic Congruences of Codes},
year={2001},
volume={E84-D},
number={3},
pages={415-418},
abstract={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²-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.},
keywords={},
doi={},
ISSN={},
month={March},}

Copy

TY - JOUR
TI - Syntactic Congruences of Codes
T2 - IEICE TRANSACTIONS on Information
SP - 415
EP - 418
AU - Tetsuo MORIYA
AU - Itaru KATAOKA
PY - 2001
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E84-D
IS - 3
JA - IEICE TRANSACTIONS on Information
Y1 - March 2001
AB - 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²-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.
ER -