Synthesis of automata from elements with given constraints on their complexity

Abstract

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.