The Community for Technology Leaders
Green Image
Issue No. 05 - May (1971 vol. 20)
ISSN: 0018-9340
pp: 578-580
The principal result of Paull and Unger on incomplete machine minimization is given an algebraic setting whereby an analogy with the classical minimization theory for Boolean functions is exhibited.
Closure operators, incomplete machines, irredundant coverings, minimization theory, Rabin?Scott automata.
R.E. Prather, "An Algebraic Proof of the Paull?Unger Theorem", IEEE Transactions on Computers, vol. 20, no. , pp. 578-580, May 1971, doi:10.1109/T-C.1971.223294
88 ms
(Ver 3.3 (11022016))