Programming, Games and Transportation Networks
Programming, Games and Transportation Networks
复制标题
DOI：
10.1093/comjnl/9.2.166
复制
发表时间：
1966-08
期刊：
影响因子：
--
通讯作者：
K. Haley
中科院分区：
文献类型：
--
作者：
K. Haley
定义表示空集，这个符号以前被广泛用作函数算子。第二卷是更有价值的两个提供，因为它确实是第一个统一的书籍形式的重要发展的分析和综合的顺序机已经出现在过去十年。著名的摩尔-米利模型在第六章中解释（编号从第一卷继续），此后在第七章中作为讨论状态最小化技术的基础，在第八章中作为讨论状态分配的基础。最小化技术描述的基础上的工作，米利，昂格尔和保尔，也对作者自己的出版物，而一章的分配显示第一次如何组合逻辑表达式是从一个给定的任务，继续与一个基本的经验法则分配方法，并完成描述的状态分区的方法Hartmanis，更简单地说，映射方法的阿姆斯特朗。第9章和第10章分别处理异步和速度无关电路，包括相当充分地讨论遇到的主要危险以及如何处理它们。Hartmanis的状态分配的划分理论是选择有效分配的间接方法，米勒医生的只言片语（第112页）关于分区的动机（减少依赖性）给出没有建议的怀疑存在的可能性，实现nearoptimal设计的复杂的机器，通过这种方法。阿姆斯特朗的更直接的方法有一个优点，即提供了可编程算法，这在处理多状态机时是一个虚拟的必要条件。
Book Reviews {Continued from p. 143) definition to indicate an empty set, the symbol having previously been widely used as a functional operator. Volume II is the more valuable of the two providing, as it does, the first unification in book form of important developments in the analysis and synthesis of sequential machines which have appeared during the past ten years. The wellknown Moore-Mealy model is explained in Chapter 6 (numbering continued from Vol. I) and used thereafter as a basis for discussion of state minimization techniques in Chapter 7, and state assignment in Chapter 8. Minimization techniques described are based upon the work of Mealy, Unger and Paull and also upon the author's own publications, whilst the chapter on assignment shows first how combinational logical expressions are obtained from a given assignment, continues with an elementary rule-of-thumb assignment method, and finishes with descriptions of the state-partition approach of Hartmanis and, more briefly, the mapping method of Armstrong. Chapters 9 and 10 deal with asynchronous and speedindependent circuits, respectively, including a fairly full discussion of the principal hazards encountered and how to deal with them.The partition theory of Hartmanis for state assignment is an indirect approach to the choice of efficient assignments, and Dr. Miller's very few words (page 112) on the motive for partitioning (reduced dependence) give no suggestion of the doubts which exist about the likelihood of achieving nearoptimum designs of complex machines by this method. The more direct approach of Armstrong has the advantage, again not clearly indicated by the author, of providing programmable algorithms, a virtual necessity when dealing with multistate machines.