By Topic

An Algebraic Method for Minimizing the Number of States in an Incomplete Sequential Machine

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.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

1 Author(s)

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.

Published in:

Computers, IEEE Transactions on  (Volume:C-17 ,  Issue: 8 )