| 求不确定自动机最小闭覆盖的一种方法 |
| |
| 引用本文： | 王秀贵. 求不确定自动机最小闭覆盖的一种方法[J]. 湘潭大学自然科学学报, 1995, 17(2): 128-132 |
| |
| 作者姓名： | 王秀贵 |
| |
| 作者单位： | 湘潭大学计算机科学系 |
| |
| 摘 要： | 本文提出了求不确定自动机最小闭覆盖的一种较简便的方法．这个方法依据本文给出的两个定理，只需计算一小部分而不是全部相容类，便可获得所给自动机的一个最小闭覆盖．
|
| 关 键 词： | 不确定自动机，最小闭覆盖，相容类 |
A METHOD FOR MINIMUM CLOSED COVER OF INCOMPLETELY SPECIFIED SEQUENTIAL MACHINES |
| |
| Wang Xiugui. A METHOD FOR MINIMUM CLOSED COVER OF INCOMPLETELY SPECIFIED SEQUENTIAL MACHINES[J]. Natural Science Journal of Xiangtan University, 1995, 17(2): 128-132 |
| |
| Authors: | Wang Xiugui |
| |
| Abstract: | A simpler algorithm for minimizing incompletely specified sequential machines is presented in this paper.The algorithm bases upon the two theorems given in the paper.Using this method we get the minimum closed cover of an incompletely specified automat faster,only calculating a small part of the whole compatible clases. |
| |
| Keywords: | incompletely specified sequential machine compatible class Minimum closed cover |
| 本文献已被 CNKI 维普 等数据库收录！ |
