Theory and Design Switching Circ
Theory and Design Switching Circ
Optimal representations of finite state machines for computer simulation
Optimal representations of finite state machines for computer simulation
Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)
Universal Logic Modules and Their Applications
IEEE Transactions on Computers
On the Design of Universal Boolean Functions
IEEE Transactions on Computers
Theory and Implementation of p-Multiple Sequential Machines
IEEE Transactions on Computers
A Numerical Expansion Technique and Its Application to Minimal Multiplexer Logic Circuits
IEEE Transactions on Computers
Direct Transition Memory and its Application in Computer Design
IEEE Transactions on Computers
Iteratively Realized Sequential Circuits
IEEE Transactions on Computers
Modular decomposition of synchronous sequential machines
FOCS '67 Proceedings of the 8th Annual Symposium on Switching and Automata Theory (SWAT 1967)
State assignment for realizing modular input-free sequential logical networks without invertors
Journal of Computer and System Sciences
Generation of near-optimal universal Boolean functions
Journal of Computer and System Sciences
Data Exchange Optimization in Reconfigurable
IEEE Transactions on Computers
Efficient Internode Communications in Reconfigurable Binary Trees
IEEE Transactions on Computers
| Hi-index | 14.99 |
This paper considers the synthesis of the network N which realizes the original program (problem oriented network) N is assembled from n unit modules partitioned into r categories (r = 1) each of which is formed from identical modules.