1. Z. Arevalo, J. G. Bredeson, “A method to simplify a Boolean function into a near minimal sum-of-products for programmable logic arrays,” IEEE Trans, on Comput., C-27, pp. 1028–1039, Nov. 1978.
2. M. Auguin, F. Boeri, and C. Andre, “An algorithm for designing multiple Boolean functions: Application to PLA’s,” Digital Process, Vol. 4, No. 3-4, pp. 215–230, 1978.
3. T.C. Bartee, “Computer design of multiple-output logical networks,” IRE Trans, on Elect. and Comp., pp. 21–30, March 1961.
4. T.C. Bartee, I.L. Lebow, I.S. Reed, Theory and Design of Digital Machines, McGraw-Hill, New York, 1962.
5. Ph. W. Besslich and P. Pichlbauer, “Fast transform procedure for the generation of near minimal covers of Boolean functions,” IEE Proc., Vol. 128, Part E, No. 6, pp. 250–254, Nov. 1981.