This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Delayed Universal Logic Modules and Sequential Machine Synthesis
August 1975 (vol. 24 no. 8)
pp. 853-855
T. Le Van, Centre de Recherche Industrielle du Qu?bec, Cit? Universitaire
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, N. Van Houtte, "Delayed Universal Logic Modules and Sequential Machine Synthesis," IEEE Transactions on Computers, vol. 24, no. 8, pp. 853-855, Aug. 1975, doi:10.1109/T-C.1975.224323
Usage of this product signifies your acceptance of the Terms of Use.