For Full-Text PDF, please login, if you are a member of IEICE,|
or go to Pay Per View on menu list, if you are a nonmember of IEICE.
Composition of Strongly Infix Codes
IEICE TRANSACTIONS on Information and Systems
Publication Date: 1998/06/25
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>>
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.