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.
Keywords :
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.; Automata; Binary trees; Circuit synthesis; Delay; Electric variables control; Equations; Input variables; Logic design; Multiplexing; Switching circuits; 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.;
