Abstract
Abstract—A structure of distributive lattice is defined on the set of partial coverings of a finite nonempty set. From this structure is derived an algorithm for calculating a minimal closed covering of the states in an incomplete sequential machine.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have