Abstract
Problem of realizing sequential machines with a structure in which the memory elements are connected in the form consisting of a minimum number of shift-registers is studied. The shift- registers in these realizations are in general two-way, that is, the content can be shifted to right as well as left. An efficient state assignment method for such realizations is presented.
| Original language | English (US) |
|---|---|
| Title of host publication | Unknown Host Publication Title |
| Pages | 722-731 |
| Number of pages | 10 |
| State | Published - 1968 |
| Externally published | Yes |
| Event | Allerton Conference on Circuit & Systems Theory, 6th-Proc - Duration: Oct 2 1968 → Oct 4 1968 |
Other
| Other | Allerton Conference on Circuit & Systems Theory, 6th-Proc |
|---|---|
| Period | 10/2/68 → 10/4/68 |
ASJC Scopus subject areas
- Engineering(all)