UNIFORM DECOMPOSITION OF INCOMPLETELY SPECIFIED SEQUENTIAL-MACHINES

作     者：WILLIAMS, GH 

作者机构：UNION COLL DEPT ELECT ENGN SCHENECTADY NY 12308 USA 

出 版 物：《IEEE TRANSACTIONS ON COMPUTERS》 (IEEE Trans Comput)

年 卷 期：1975年第24卷第8期

页      面：840-843页

核心收录：

学科分类：0808[工学-电气工程] 08[工学] 0812[工学-计算机科学与技术（可授工学、理学学位）] 

主　　题：Covering problem incompletely specified sequential machines uniform decomposition. 

摘      要：In this correspondence uniform decomposition procedures are extended to incompletely specified sequential machines. Any given Moore sequential machine is realized by interconnecting copies of a universal two-state component machine. The information processed by each component machine is represented by its corresponding partial mapping. When the sequential machine is incompletely specified, a reduction in the number of component machine copies is possible. The reduction is found by a uniform-cost search algorithm which finds a minimal cover on the set of partial mappings.