The Community for Technology Leaders
RSS Icon
Subscribe
Issue No.05 - May (1971 vol.20)
pp: 578-580
ABSTRACT
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.
INDEX TERMS
Closure operators, incomplete machines, irredundant coverings, minimization theory, Rabin?Scott automata.
CITATION
R.E. Prather, "An Algebraic Proof of the Paull?Unger Theorem", IEEE Transactions on Computers, vol.20, no. 5, pp. 578-580, May 1971, doi:10.1109/T-C.1971.223294
62 ms
(Ver 2.0)

Marketing Automation Platform Marketing Automation Tool