| In 2010, Jean Berstel and others have discussed the relation between the indica-tor, degree and the kernel of the bifix codes in the book 《C odes and Automata》, and have shown that a code obtained by a internal transformation of a finite max-imal bifix code is also a finite maximal bifix code. In the second chapter of this paper, we have discussed the relation between the indicator, degree and the kernel of the prefix codes, infix codes and uniform codes. In the third chapter of this paper, we discussed the reversal of the code which received by a internal transformation of a uniform code, and proved that a code obtained by a internal transformation of a infix code is also a infix code. In 2012, in the paper [Bifix Codes and Stur-mian Words], by adding some conditions, Jean Berstel get some new codes, for example:F-prefix codes, F-maximal prefix codes, F-maximal codes and so on. In the last chapter of this paper, we have main discussed the F-completeness, the F-denseness of those new codes. |
PDF Full Text Request