TY - JOUR
T1 - Synthesis of automata from elements with given constraints on their complexity
AU - Baranov, S.
AU - Bregman, L.
PY - 1994/7
Y1 - 1994/7
N2 - Techniques for logic synthesis of control units from elements with given constraints on their complexity are presented. Programmable logic arrays (PLA) with restrictions on the number of inputs, outputs and terms are used as an example of such elements. Two synthesis methods are suggested: terms distribution and distribution of pairs (term, function), and two algorithms, precise and approximate, are described. The results of computational experiments with these algorithms are discussed.
AB - Techniques for logic synthesis of control units from elements with given constraints on their complexity are presented. Programmable logic arrays (PLA) with restrictions on the number of inputs, outputs and terms are used as an example of such elements. Two synthesis methods are suggested: terms distribution and distribution of pairs (term, function), and two algorithms, precise and approximate, are described. The results of computational experiments with these algorithms are discussed.
UR - http://www.scopus.com/inward/record.url?scp=43949150686&partnerID=8YFLogxK
U2 - 10.1006/jmca.1994.1014
DO - 10.1006/jmca.1994.1014
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:43949150686
SN - 0745-7138
VL - 17
SP - 227
EP - 237
JO - Journal of Microcomputer Applications
JF - Journal of Microcomputer Applications
IS - 3
ER -