An Algebraic Proof of the Paull-Unger Theorem

Authors:
R. E. Prather
Affiliations:
-
Venue:
IEEE Transactions on Computers
Year:
1971

Citing 1
Cited 1

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Algebraic structure theory of sequential machines (Prentice-Hall international series in applied mathematics)

Closure Partition Method for Minimizing Incomplete Sequential Machines

IEEE Transactions on Computers

Quantified Score

Hi-index	14.98

Visualization

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.