DocumentCode
867169
Title
Reduction of the number of states in incompletely specified sequential machines
Author
Kohavi, Zvi
Author_Institution
Polytechnic Institute of Brooklyn, Brooklyn, USA
Volume
1
Issue
7
fYear
1965
fDate
9/1/1965 12:00:00 AM
Firstpage
209
Lastpage
210
Abstract
In this note a method is presented for finding in a quick way the set of all maximal compatibles of an incompletely specified sequential machine. The basic tool is the modified merger diagram. The closed set of compatibles corresponds to the set of state of the new reduced machine.
Keywords
calculating apparatus; switching;
fLanguage
English
Journal_Title
Electronics Letters
Publisher
iet
ISSN
0013-5194
Type
jour
DOI
10.1049/el:19650192
Filename
4205776
Link To Document