DocumentCode
1104740
Title
State Minimization of Incompletely Specified Sequential Machines
Author
Kella, Jehuda
Issue
4
fYear
1970
fDate
4/1/1970 12:00:00 AM
Firstpage
342
Lastpage
348
Abstract
This paper describes a new method for the state minimization of incompletely specified sequential machines. Previously described methods start with generating all maximal compatibles of states of the original incompletely specified machine and then try to find a closed cover which consists of a minimal number of MCs or portions of MCs. This process involves a long enumeration process and, as the number of states grows, turns out to be impractical for hand calculation.
Keywords
Compatible states, incompletely specified machines, sequential machines, state reduction.; Helium; Minimization methods; Compatible states, incompletely specified machines, sequential machines, state reduction.;
fLanguage
English
Journal_Title
Computers, IEEE Transactions on
Publisher
ieee
ISSN
0018-9340
Type
jour
DOI
10.1109/T-C.1970.222920
Filename
1671513
Link To Document