A Note on Parses of Codes
Summary :
In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.
- Publication
- IEICE TRANSACTIONS on Information Vol.E86-D No.11 pp.2472-2474
- Publication Date
- 2003/11/01
- Publicized
- Online ISSN
- DOI
- Type of Manuscript
- LETTER
- Category
- Theory of Automata, Formal Language Theory
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, "A Note on Parses of Codes" in IEICE TRANSACTIONS on Information,
vol. E86-D, no. 11, pp. 2472-2474, November 2003, doi: .
Abstract: In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.
URL: https://global.ieice.org/en_transactions/information/10.1587/e86-d_11_2472/_p
Copy
@ARTICLE{e86-d_11_2472,
author={Tetsuo MORIYA, },
journal={IEICE TRANSACTIONS on Information},
title={A Note on Parses of Codes},
year={2003},
volume={E86-D},
number={11},
pages={2472-2474},
abstract={In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.},
keywords={},
doi={},
ISSN={},
month={November},}
Copy
TY - JOUR
TI - A Note on Parses of Codes
T2 - IEICE TRANSACTIONS on Information
SP - 2472
EP - 2474
AU - Tetsuo MORIYA
PY - 2003
DO -
JO - IEICE TRANSACTIONS on Information
SN -
VL - E86-D
IS - 11
JA - IEICE TRANSACTIONS on Information
Y1 - November 2003
AB - In this note, we present some results about parses of codes. First we present a sufficient condition of a bifix code to have the bounded indicator. Next we consider a proper parse, introduced notion. We prove that for a strongly infix code, the number of proper parses is at most three under some condition. We also prove that if a code X has a unique proper parse for each word under the same condition, then X is a strongly infix code.
ER -
English
