A Note on Parses of Codes

Tetsuo MORIYA  

IEICE TRANSACTIONS on Information and Systems   Vol.E86-D   No.11   pp.2472-2474
Publication Date: 2003/11/01
Online ISSN: 
Print ISSN: 0916-8532
Type of Manuscript: LETTER
Category: Theory of Automata, Formal Language Theory
bifix code,  parse,  prefix code,  suffix code,  strongly infix code,  

Full Text: PDF>>
Buy this Article

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.