Abstract
We have been considering certain algorithms which can be used in the abstract synthesis of a control automaton. A distinctive feature of these algorithms is the fact that even in the stage of abstract synthesis both the nature of the whole microprogram and the properties of the individual microinstructions are taken into account, and this produces an additional saving in equipment in the structural synthesis stage. The abstract synthesis stage ends with the construction and minimization of the transition and output tables. Problems associatural tables belong to the structural synthesis and will be discussed separately.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
