Cart (Loading....) | Create Account
Close category search window
 

Closure Partition Method for Minimizing Incomplete Sequential Machines

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)
Yang, Chao-Chih ; Department of Information Sciences, University of Alabama

A new method based on a closure partition over a set of some compatibles is proposed for selecting a minimal machine from mutualy independent closure aggregates by simply checking only the trivial covering condition. The closure aggregates are derived from some closure related classes. The latter classes are derived from the closure classes by replacing aU superseded elements with their greatest superseding ones. The compatibles to be considered are some subsets of maximum compatibles related under the state transition or the set inclusion. Closure dependent classes may contain superseded and redundant compatibles but their corresponding closure aggregates have only unsuperseded and irredundant elements. Both of them are closed. However, some closure related class may not be closed and may contain some redundant elements. The remaining unrelated subsets of maximum compatibles are ignored. Superseded or redundant compatibles when they are so determined are also ignored. Thus possible candidates for irredundant closed covers can be yielded and then partitioned under the closure dependence relation.

Published in:

Computers, IEEE Transactions on  (Volume:C-22 ,  Issue: 12 )

Date of Publication:

Dec. 1973

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.