Presentation	2001/10/12 Membership of words in Codes Tetsuo MORIYA,
PDF Download Page	PDF download Page Link
Abstract(in Japanese)	(See Japanese page)
Abstract(in English)	We consider the following three statements for a code L. (P1) For every n≥2, both ω^n⋴L^n and ω^⋴L^ implies ω⋴L. (P2) For every n≥2, if ω^n⋴L^n, then ω⋴L.(P3) For every m, k≥2 with m≤k, ω^k⋴L^m implies ω⋴L. First we show that for every code L, P1 holds. Next we show that for every infix code L, P2 holds, and that a code L is an infix code iff P2 holds and L is a weakly infix code. Last we show that for every strongly infix code L, P3 holds, and that a code L is a strongly infix code iff P3 holds and L is a hyper infix code.
Keyword(in Japanese)	(See Japanese page)
Keyword(in English)	prefix code / suffix code / infix code / strongly infix code
Paper #	COMP 2001-49
Date of Issue

Conference Information
Committee	COMP
Conference Date	2001/10/12(1days)
Place (in Japanese)	(See Japanese page)
Place (in English)
Topics (in Japanese)	(See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To	Theoretical Foundations of Computing (COMP)
Language	JPN
Title (in Japanese)	(See Japanese page)
Sub Title (in Japanese)	(See Japanese page)
Title (in English)	Membership of words in Codes
Sub Title (in English)
Keyword(1)	prefix code
Keyword(2)	suffix code
Keyword(3)	infix code
Keyword(4)	strongly infix code
1st Author's Name	Tetsuo MORIYA
1st Author's Affiliation	Department of Electrical Engineering, Faculty of Engineering Kokushikan University()
Date	2001/10/12
Paper #	COMP 2001-49
Volume (vol)	vol.101
Number (no)	376
Page	pp.pp.-
#Pages	8
Date of Issue