ACM Computing Surveys (CSUR)
Digital Systems with Algorithm Implementation
Digital Systems with Algorithm Implementation
Introduction to Switching Theory and Logical Design
Introduction to Switching Theory and Logical Design
Designing with Programmable Array Logic
Designing with Programmable Array Logic
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Synthesis and Optimization of Programs by Means of P-Functions
IEEE Transactions on Computers
IEEE Transactions on Computers
Synthesis of Minimal Binary Decision Trees
IEEE Transactions on Computers
Synthesis and Asynchronous Implementation of Algorithms Using a Generalized P-Function Concept
IEEE Transactions on Computers
| Hi-index | 14.98 |
A general model of a memory-based finite-state machine architecture is introduced, the 2k- decision machine (2k- D). The classical (2n- D) and binary decision (2 - D) architectures are shown to be special cases of the 2k- D architecture. The equivalence among the 2k- D solutions for different values of k follows from the sequentialization prin