| 基于三方元代数理论的时序机分解中完全覆盖的求解算法 |
| |
| 引用本文： | 于筑国,张佑生.基于三方元代数理论的时序机分解中完全覆盖的求解算法[J].合肥工业大学学报(自然科学版),1996(2). |
| |
| 作者姓名： | 于筑国 张佑生 |
| |
| 作者单位： | 合肥工业大学计算机与信息系 |
| |
| 摘 要： | 文章基于三方元代数理论，提出一个时序机最优全分解过程中用到的求解完全覆盖问题的算法，该算法使用筛漏技术，使算法复杂性为Ｈ（ｎ２）
|
| 关 键 词： | 完全覆盖 时序机 状态结点集 |
AN ALGORITHM OF SEEKING COMPLETENESS COVER IN OPTIMUM FULL-DECOMPOSITION |
| |
| Yu Zhuguo,Zhang Yousheng.AN ALGORITHM OF SEEKING COMPLETENESS COVER IN OPTIMUM FULL-DECOMPOSITION[J].Journal of Hefei University of Technology(Natural Science),1996(2). |
| |
| Authors: | Yu Zhuguo Zhang Yousheng |
| |
| Institution: | Yu Zhuguo;Zhang Yousheng |
| |
| Abstract: | In this paper.we obtain an algorithm of seeking a completeness cover.This algorithm is used in optimum full-decomposition of sequential machines that are based on the theory of trinity algebra. |
| |
| Keywords: | completeness cover sequential machine state-node set |
| 本文献已被 CNKI 等数据库收录！ |
