Minimization of combinational multiplexor/selector automata (MS-automata and equivalent transformations of their trees)

Implementation of arbitrary combinational multiplexor/selector automata is considered. Minimization methods and an algorithm for minimizing the multiplexor tree are proposed.Translated from Kibernetika, No. 5, pp. 49–53, September–October, 1989.