Skip to Main Content
The general class of sequential machines defined by Mealy is investigated. It is found that any such machine can be identified with a set of machines of equivalent minimality. A procedure for developing the aggregate of all sets of gates for such minimal machines is evolved, and the problem of selecting components for constructing machines is discussed.
Date of Publication: Sept. 1959