Presentation | 1998/12/4 Closure property of Some Codes under Composition Tetsuo MORIYA, |
---|---|
PDF Download Page | PDF download Page Link |
Abstract(in Japanese) | (See Japanese page) |
Abstract(in English) | We consider closure property of some classes of codes under composition. A code X is a strongly infix (outfix) code if X is an infix (outfix) code and any catenation of two words in X and has no proper (infix) outfix in X, which is neither a left factor nor a right factor. We show that the class of strongly infix codes is closed under composition, and as the dual result, that the property to be strongly outfix is inherited by a componet of a decomposition. |
Keyword(in Japanese) | (See Japanese page) |
Keyword(in English) | prefix code / suffix code / infix code / composition of codes |
Paper # | COMP98-63 |
Date of Issue |
Conference Information | |
Committee | COMP |
---|---|
Conference Date | 1998/12/4(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 | ENG |
Title (in Japanese) | (See Japanese page) |
Sub Title (in Japanese) | (See Japanese page) |
Title (in English) | Closure property of Some Codes under Composition |
Sub Title (in English) | |
Keyword(1) | prefix code |
Keyword(2) | suffix code |
Keyword(3) | infix code |
Keyword(4) | composition of codes |
1st Author's Name | Tetsuo MORIYA |
1st Author's Affiliation | Department of Electrical Engineering, Faculty of Engineering Kokushikan University() |
Date | 1998/12/4 |
Paper # | COMP98-63 |
Volume (vol) | vol.98 |
Number (no) | 442 |
Page | pp.pp.- |
#Pages | 7 |
Date of Issue |