Composition of Strongly Infix Codes

Tetsuo MORIYA  

IEICE TRANSACTIONS on Information and Systems   Vol.E81-D   No.6   pp.609-611
Publication Date: 1998/06/25
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Automata,Languages and Theory of Computing
prefix code,  suffix code,  infix code,  composition of codes,  

Full Text: PDF>>
Buy this Article

We introduce a strongly infix code. A code X is a strongly infix code if X is an infix code and any catenation of two words in X has no proper factor 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 infix is inherited by a component of a decomposition.