Biswas, NN (1974) State Minimization of Incompletely Specified Sequential Machines. In: IEEE Transactions on Computers, C23 (1). pp. 80-84.Full text not available from this repository. (Request a copy)
A simple procedure for the state minimization of an incompletely specified sequential machine whose number of internal states is not very large is presented. It introduces the concept of a compatibility graph from which the set of maximal compatibles of the machine can be very conveniently derived. Primary and secondary implication trees associated with each maximal compatible are then constructed. The minimal state machine covering the incompletely specified machine is then obtained from these implication trees.
|Item Type:||Journal Article|
|Additional Information:||Copyright 1974 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Department/Centre:||Division of Electrical Sciences > Electrical Communication Engineering|
|Date Deposited:||17 Dec 2009 08:14|
|Last Modified:||17 Dec 2009 08:14|
Actions (login required)