System Maintenance:
There may be intermittent impact on performance while updates are in progress. We apologize for the inconvenience.
By Topic

A Method for Minimizing Incompletely Specified 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)
Yamamoto, M. ; Department of Management Engineering, Nagoya Institute of Technology

After Paull and Unger introduced the problem of state minimization in incompletely specified sequential machines (ISSM's), its increasing importance and complexity induced many people to continue research related to this field. Here we shall present a method for obtaining a minimum form of a given ISSM by application of a directed tree graph. In order to save counting effort for a minimum form, we extend the concept of erasure from a relation between compatibles to one between subsets of compatibles. The use of the extended erasure rules can prune the directed tree graph effectively to find a minimum form of a given ISSM. Furthermore, by utilizing the concept of maximal incompatible (MI) we can determine a lower bound for the state number of the minimum form of a given ISSM, and also effectively control the initial steps in generating the directed tree graph.

Published in:

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