DocumentCode
1113437
Title
State Minimization of Incompletely Specified Sequential Machines
Author
Biswas, Nripendra N.
Author_Institution
Department of Electrical Communication Engineering, Indian Institute of Science
Issue
1
fYear
1974
Firstpage
80
Lastpage
84
Abstract
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.
Keywords
Augmentation, bunching, compatibility graph, implication trees, incompletely specified sequential machine, maximal compatibles, merger graph, sequential machine, state minimization, state reduction, substitution.; Character generation; Corporate acquisitions; Helium; Tree graphs; Augmentation, bunching, compatibility graph, implication trees, incompletely specified sequential machine, maximal compatibles, merger graph, sequential machine, state minimization, state reduction, substitution.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1974.223780
Filename
1672373
Link To Document