Title :
Reduction of the number of states in incompletely specified sequential machines
Author_Institution :
Polytechnic Institute of Brooklyn, Brooklyn, USA
fDate :
9/1/1965 12:00:00 AM
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;
Journal_Title :
Electronics Letters
DOI :
10.1049/el:19650192
