The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.08 - August (1975 vol.24)
pp: 853-855
T. Le Van , Centre de Recherche Industrielle du Qu?bec, Cit? Universitaire
ABSTRACT
A universal logic module of n variables (ULM-n) can be considered as a 2n-in-1 multiplexer (inverse binary tree) whose code is determined by the presentation of external variables. This interpretation permits synthesis of sequential machines. Starting from the state transition map, any sequential machine can be realized by delayed ULM's and OR gates. The decomposition concept of Weiner and Hopcroft is generalized to form a uniform synthesis of n-variable sequential machines.
INDEX TERMS
Accepted sequence, component machine, decomposition, delayed universal logic module, distributed logic, inverse binary tree, nondeterministic automaton, reversed machine, sequential machine, simple synthesis, transition map, 2n-in-1 multiplexer, universal logic module.
CITATION
T. Le Van, "Delayed Universal Logic Modules and Sequential Machine Synthesis", IEEE Transactions on Computers, vol.24, no. 8, pp. 853-855, August 1975, doi:10.1109/T-C.1975.224323
35 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool