东北大学学报(自然科学版) ›› 2009, Vol. 30 ›› Issue (5): 753-756.DOI: -

• 论著 • 上一篇    下一篇

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

刘群;李红;   

  1. 东北大学秦皇岛分校;
  • 收稿日期:2013-06-22 修回日期:2013-06-22 出版日期:2009-05-15 发布日期:2013-06-22
  • 通讯作者: Liu, Q.
  • 作者简介:-
  • 基金资助:
    国家自然科学基金资助项目(10471099)

Generalized prefix relations on free monoids and maximal independent languages

Liu, Qun (1); Li, Hong (1)   

  1. (1) Northeastern University at Qinhuangdao, Qinhuangdao 066004, China
  • Received:2013-06-22 Revised:2013-06-22 Online:2009-05-15 Published:2013-06-22
  • Contact: Liu, Q.
  • About author:-
  • Supported by:
    -

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

关键词: L-前缀关系, L-无关语言, 极大L-无关语言, 星号语言, 具有延迟界d的延迟码, 完全码, 完全L-无关语言

Abstract: 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. In this way a clear understanding is available to various methods of completion of codes.

中图分类号: