SECONDARY STATE ASSIGNMENT FOR SEQUENTIAL MACHINES,
Abstract
One of the most important and complicated prob lems in the synthesis of a sequential machine, described by a state diagram or table is the as signment of the states of the secondary variables to the states of the machine. The secondary assignment for a given machine varies in accord ance with the requirements of the design. It has already been shown that the partition with the substitutiperty is of great significance in the secondary assignment. However, only few machines possess these properties, and hence, a more general method is needed. This paper pre sents a method for obtaining for any given machine M an equivalent machine M' which has a partition with the substitution property and therefore can be decomposed into several sub machines connected in cascade or in parallel. It is also shown that for machine M' we can find an assignment with self dependent subsets. The method is shown to be general for any completely or incompletely specified sequential machine. (Author)
Document Details
- Document Type
- Technical Report
- Publication Date
- Mar 01, 1963
- Accession Number
- AD0416431
Entities
People
- Zvi Kohavi
Organizations
- New York University Tandon School of Engineering