科研成果详情

Several properties of the products of finite maximal prefix, maximal biprefix, semaphore, synchronous, maximal infix and maximal outfix codes are discussed respectively. We show that, for two nonempty subsets X and Y of A* such that the product XY being thin, if XY is a maximal biprefix code, then X and Y are maximal biprefix codes. Also, it is shown that, for two finite nonempty subsets X and Y of A* such that the product XY being unambiguous, if XY is a semaphore code then X and Y are semaphore codes. Finally, two open problems to the product of finite semaphore and maximal infix codes are presented.