THE SYNTHESIS OF SCHEMES IN MULTISTAGE MEMORY AUTOMATA,
FOREIGN TECHNOLOGY DIV WRIGHT-PATTERSON AFB OHIO
Pagination or Media Count:
Storage memory automata can be built for any number n of states by using n NOR elements with 2 n-1 inputs in each element. Formulas are deduced for selecting such storage elements which minimize the scheme of the automaton being designed. Using the Moore automaton as an element, this theorem is proven The number of states of an elementary automaton required for minimizing the equipment of the automaton being synthesized depends only on the nunber of branches transition pairs of this automaton it is independent of the number of states of the designed automaton. A numerical example shows that, for automata whose graphs have 23 or 40 branches, a 3-state and 4-state elementary automata, respectively, will be most expedient.
- Computer Hardware