自由么半群上的广义前缀关系与极大无关语言

研究了与L-前缀关系无关的语言,把码的完全化构造方法推广为一般L-无关语言的完全化构造方法,并反过来用这种一般构造方法审视码的完全化.由于在码的完全化过程中,所涉及的关系与完全化之后的结果相关,从而必须引入各种技巧,运用L-无关语言完全化的一般构造方法可以阐明这种技巧的切入点,从而对码的各种完全化方法有一个较清晰的认识.

Generalized Prefix Relations on Free Monoids and Maximal Independent Languages

Studies the languages that are independent of the L-prefix relation.The construction of the completion of codes are generalized as that of L-independent languages and on the other hand,the latter can be used to examine the former.In the completing process of codes the relation involved is bound up with the result of completion.It is therefore necessary to introduce various techniques into the process,and how they function can be expounded by the general construction of completion of L-independent languages....