A free monoid containing all prefix codes
摘要
In this paper, we exhibit a free monoid containing all prefix codes in connection with the sets of i-th powers of primitive words for all i ≥; 2. This extends two results given by Shyr and Tsai in 1998 at the same time.