Abstract:
A procedure is proposed for reducing the number of microoperations and logical conditions in microprograms which are incompletely realized by certain control automata. Conditions are determined for compatibility of the microoperations and union of logical conditions. Solution of that problem is shown to be reducible to solution of the graph coloring problem.
Fulltext:
PDF file (1402 kB)