English

应用科学学报 ›› 1991, Vol. 9 ›› Issue (2): 177-181.

• 论文 • 上一篇    下一篇

可识强码的分解

邱伟德1, 章亮2   

  1. 1. 上海工业大学;
    2. 上海城市建设学院
  • 收稿日期:1989-12-15 修回日期:1990-06-16 出版日期:1991-06-30 发布日期:1991-06-30
  • 基金资助:
    上海市高教局科研基金资助课题

DECOMPOSITION OF RECOGNIZABLE STRONG CODES

QIU WEIDE1, ZHANG LING2   

  1. 1. Shanghai University of Technology;
    2. Shanghai college of Achitectural and Municipal Engineering
  • Received:1989-12-15 Revised:1990-06-16 Online:1991-06-30 Published:1991-06-30

PDF

55

摘要： 研究强码,得到以下三个结果:(1)任意一个群都可以成为X*的句法么半群,其中X是某个极大强码;(2)可识强码X可分解为两个可识强码复合的充要条件为接受X*的最小自动机上存在真同余;(3)句法么半群为单群的极大强码称为单极大强码,任一可识强码可分解为有限个单可识强码的复合.

关键词: 强码, 可识码, 自动机, 码的复合, 单群

Abstract: In this paper we give the following results:(1)Every group is a syntactic monoid of language X* with X being a maximal strong code; (2) Recognizable strong code X can decompose into two recognizable strong codes iff there is a proper congruence in the minimal automaton recongnizing X*; (3)the maximal strong code, whose syntactic monoid is a simple group, is called a simple maximal strong code. Any recognizable strong code can decompose into a finite number of simple recognizable strong codes.

Key words: composition of codes, simple group, recognizable code, automaton, strong code