Composition of Strongly Infix Codes
Summary :
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.
- Publication
- IEICE TRANSACTIONS on Information Vol.E81-D No.6 pp.609-611
- Publication Date
- 1998/06/25
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- Category
- Automata,Languages and Theory of Computing
Authors
Keyword
Latest Issue
Copyrights notice of machine-translated contents
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Cite this
Copy
Tetsuo MORIYA, "Composition of Strongly Infix Codes" in IEICE TRANSACTIONS on Information,
vol. E81-D, no. 6, pp. 609-611, June 1998, doi: .
Abstract: 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.
URL: https://global.ieice.org/en_transactions/information/10.1587/e81-d_6_609/_p
Copy
@ARTICLE{e81-d_6_609,
author={Tetsuo MORIYA, },
journal={IEICE TRANSACTIONS on Information},
title={Composition of Strongly Infix Codes},
year={1998},
volume={E81-D},
number={6},
pages={609-611},
abstract={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.},
keywords={},
doi={},
ISSN={},
month={June},}
Copy
TY - JOUR
TI - Composition of Strongly Infix Codes
T2 - IEICE TRANSACTIONS on Information
SP - 609
EP - 611
AU - Tetsuo MORIYA
PY - 1998
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E81-D
IS - 6
JA - IEICE TRANSACTIONS on Information
Y1 - June 1998
AB - 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.
ER -
English
