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.
A Note on Parses of Codes
IEICE TRANSACTIONS on Information and Systems
Publication Date: 2003/11/01
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>>
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.