Scheduled System Maintenance:
On May 6th, system maintenance will take place from 8:00 AM - 12:00 PM ET (12:00 - 16:00 UTC). During this time, there may be intermittent impact on performance. We apologize for the inconvenience.
By Topic

An Algebraic Proof of the Paull–Unger Theorem

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

The purchase and pricing options are temporarily unavailable. Please try again later.
1 Author(s)

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-20 ,  Issue: 5 )