| 可识强码的分解 |
| |
| 引用本文： | 邱伟德,章亮.可识强码的分解[J].应用科学学报,1991(2). |
| |
| 作者姓名： | 邱伟德 章亮 |
| |
| 作者单位： | 上海工业大学
(邱伟德)，上海城市建设学院(章亮) |
| |
| 基金项目： | 上海市高教局科研基金资助课题 |
| |
| 摘 要： | 研究强码,得到以下三个结果:(1)任意一个群都可以成为X~*的句法么半群,其中X是某个极大强码;(2)可识强码X可分解为两个可识强码复合的充要条件为接受X~*的最小自动机上存在真同余;(3)句法么半群为单群的极大强码称为单极大强码,任一可识强码可分解为有限个单可识强码的复合.
|
| 关 键 词： | 强码 可识码 码的复合 单群 自动机 |
DECOMPOSITION OF RECOGNIZABLE STRONG CODES |
| |
| QIU WEIDE.DECOMPOSITION OF RECOGNIZABLE STRONG CODES[J].Journal of Applied Sciences,1991(2). |
| |
| Authors: | QIU WEIDE |
| |
| Institution: | QIU WEIDE (Shanghai University of Technology)ZHANG LING(Shanghai college of Achitectural and Municipal Engineering) |
| |
| 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) Eecognizable strong code X can decompose into two recognizable strong codes iff there is a proper congruence in the minimal automaton reoongnizing 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. |
| |
| Keywords: | strong code recognizable code composition of codes simple group sutomaton |
| 本文献已被 CNKI 等数据库收录！ |
